Sequential and distributed on-the-fly computation of weak tau-confluence

DOI10.1016/J.SCICO.2011.07.004zbMath1243.68219OpenAlexW2085384028MaRDI QIDQ436408

Anton Wijs, Radu Mateescu

Publication date: 20 July 2012

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.scico.2011.07.004

zbMATH Keywords

labelled transition systemBoolean equation systembranching bisimulationon-the-fly verificationpartial order reduction

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Compositional verification of concurrent systems by combining bisimulations

Uses Software

• SPIN
• CADP
• CAESAR_SOLVE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Confluence for process verification
• A linear algorithm to solve fixed-point equations on transition systems
• Model checking and boolean graphs
• Weak confluence and \(\tau\)-inertness
• Local model checking and protocol analysis
• Efficient on-the-fly model-checking for regular alternation-free \(\mu\)-calculus
• A lattice-theoretical fixpoint theorem and its applications
• CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes
• Depth-First Search and Linear Graph Algorithms
• Computer Aided Verification
• Parallelizing the \(\text{Mur}\varphi\) verifier

This page was built for publication: Sequential and distributed on-the-fly computation of weak tau-confluence