An invariant-based approach to the verification of asynchronous parameterized networks
From MaRDI portal
Publication:604385
DOI10.1016/J.JSC.2008.11.006zbMATH Open1208.68148OpenAlexW2143812611MaRDI QIDQ604385FDOQ604385
Publication date: 10 November 2010
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2008.11.006
Recommendations
Cites Work
- Title not available (Why is that?)
- Characterizing finite Kripke structures in propositional temporal logic
- Reasoning about systems with many processes
- CONCUR 2004 - Concurrency Theory
- Title not available (Why is that?)
- On Reasoning About Rings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Verification by augmented finitary abstraction
- A structural induction theorem for processes
- Computer Science Logic
- Correct Hardware Design and Verification Methods
- A minimized automaton representation of reachable states
- An approach to the verification of symmetric parameterized distributed systems
- Equivalence and preorder checking for finite-state systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- FM 2005: Formal Methods
Cited In (3)
Uses Software
This page was built for publication: An invariant-based approach to the verification of asynchronous parameterized networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604385)