Sequential and distributed on-the-fly computation of weak tau-confluence
DOI10.1016/J.SCICO.2011.07.004zbMATH Open1243.68219OpenAlexW2085384028MaRDI QIDQ436408FDOQ436408
Authors: Radu Mateescu, Anton Wijs 
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
Recommendations
Boolean equation systembranching bisimulationlabelled transition systemon-the-fly verificationpartial order reduction
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Depth-First Search and Linear Graph Algorithms
- Title not available (Why is that?)
- A lattice-theoretical fixpoint theorem and its applications
- CADP 2010: a toolbox for the construction and analysis of distributed processes
- Efficient on-the-fly model-checking for regular alternation-free \(\mu\)-calculus
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer Aided Verification
- Parallelizing the \(\text{Mur}\varphi\) verifier
- Confluence for process verification
Cited In (4)
Uses Software
This page was built for publication: Sequential and distributed on-the-fly computation of weak tau-confluence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436408)
