Compositional verification of priority systems using sharp bisimulation

DOI10.1007/s10703-023-00422-1MaRDI QIDQ6564171

Luca Di Stefano, Frédéric Lang

Publication date: 28 June 2024

Published in: Formal Methods in System Design (Search for Journal in Brave)

zbMATH Keywords

congruenceconcurrencystate space reductionfinite state processesenumerative verification

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Branching time and orthogonal bisimulation equivalence
• A journey from process algebra via timed automata to model learning. Essays dedicated to Frits Vaandrager on the occasion of his 60th birthday
• Compositional verification of asynchronous concurrent systems using CADP
• Deciding orthogonal bisimulation
• Sigref – A Symbolic Bisimulation Tool Box
• Bisimilarity Minimization in O(m logn) Time
• A Theory of Communicating Sequential Processes
• Branching time and abstraction in bisimulation semantics
• An O(m log n) algorithm for branching bisimilarity on labelled transition systems
• Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities
• Dynamic partial-order reduction for model checking software
• An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation
• Depth-First Search and Linear Graph Algorithms
• Compositional verification of concurrent systems by combining bisimulations

This page was built for publication: Compositional verification of priority systems using sharp bisimulation