Compositional verification of concurrent systems by combining bisimulations

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

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

Publication date: 14 March 2024

Recommendations

• Compositional verification of concurrent systems by combining bisimulations
• Sharp congruences adequate with temporal logics combining weak and strong modalities
• Automatic verification of concurrent systems using a formula-based compositional approach
• Compositionality and locality for improving model checking in the selective mu-calculus
• Property preserving abstractions for the verification of concurrent systems

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

• Propositional dynamic logic of regular programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Compositional verification of asynchronous concurrent systems using CADP
• Propositional dynamic logic of looping and converse is elementarily decidable
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Results on the propositional \(\mu\)-calculus
• Branching time and abstraction in bisimulation semantics
• A Theory of Communicating Sequential Processes
• Partial model checking using networks of labelled transition systems and Boolean equation systems

Cited In (1)

• Compositional verification of priority systems using sharp bisimulation

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

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