Efficient model checking for LTL with partial order snapshots
From MaRDI portal
Publication:732005
DOI10.1016/J.TCS.2009.03.002zbMath1187.68317OpenAlexW1518788150MaRDI QIDQ732005
Publication date: 9 October 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.03.002
Cites Work
- Unnamed Item
- Unnamed Item
- Proving partial order properties
- Reasoning about infinite computations
- Relationships between nondeterministic and deterministic tape complexities
- The complexity of propositional linear temporal logics
- Communicating sequential processes
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: Efficient model checking for LTL with partial order snapshots