Compositional verification of concurrent systems by combining bisimulations

DOI10.1007/978-3-030-30942-8_13zbMATH Open1539.682MaRDI QIDQ6535949

Radu Mateescu, Frédéric Lang, Franco Mazzanti

Publication date: 14 March 2024

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Propositional dynamic logic of regular programs
• Compositional verification of asynchronous concurrent systems using CADP
• Partial Model Checking using Networks of Labelled Transition Systems and Boole an Equation Systems
• Propositional dynamic logic of looping and converse is elementarily decidable
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• A Theory of Communicating Sequential Processes
• Branching time and abstraction in bisimulation semantics

Related Items (1)

Compositional verification of priority systems using sharp bisimulation

This page was built for publication: Compositional verification of concurrent systems by combining bisimulations