State space reduction for process algebra specifications
DOI10.1016/J.TCS.2005.09.064zbMATH Open1086.68091OpenAlexW1982254742MaRDI QIDQ820124FDOQ820124
Authors: Hubert Garavel, Wendelin Serwe
Publication date: 6 April 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.064
Recommendations
model checkingcompositional verificationprocess algebraCADPformal specificationlabeled transition systemdata-flow analysisLOTOSCÆSAR
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
Cited In (13)
- Reflections on the future of concurrency theory in general and process calculi in particular
- Nested-unit Petri nets
- State space reduction of linear processes using control flow reconstruction
- Algebraic Methodology and Software Technology
- Title not available (Why is that?)
- Automatic decomposition of Petri nets into automata networks -- a synthetic account
- Efficient algorithms for three reachability problems in safe Petri nets
- Static analysis of IMC
- Translating FSP into LOTOS and networks of automata
- On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP
- CADP 2010: a toolbox for the construction and analysis of distributed processes
- CAESAR
- Nested-unit Petri nets: a structural means to increase efficiency and scalability of verification on elementary nets
Uses Software
This page was built for publication: State space reduction for process algebra specifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820124)