Model checking for nominal calculi

DOI10.1007/978-3-540-31982-5_1MaRDI QIDQ5705867zbMATH OpenOpenAlexFDO

Authors Ugo Montanari, Gian Luigi Ferrari, Emilio Tuosto

Publication date 10 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106850

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Notes on nominal calculi for security and mobility
• A class of automata for the verification of infinite, resource-allocating behaviours
• Towards nominal context-free model-checking
• Model checking mobile ambients
• Modal logics for nominal transition systems

Cited in

(5)

• A class of automata for the verification of infinite, resource-allocating behaviours
• Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi
• Network Applications of Graph Bisimulation
• Completeness of Nominal PROPs
• Event based choreography

This page was built for publication: Model checking for nominal calculi

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5705867)