Well-structured transition systems everywhere!
Top Cited Papers
- 6 April 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 256 (1-2) , 63-92
- https://doi.org/10.1016/s0304-3975(00)00102-x
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Symbolic model checking: 1020 States and beyondPublished by Elsevier ,2004
- Verifying programs with unreliable channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- General decidability theorems for infinite-state systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A theory of timed automataPublished by Elsevier ,2002
- Ensuring completeness of symbolic verification methods for infinite-state systemsTheoretical Computer Science, 2001
- Algorithmic Analysis of Programs with Well Quasi-ordered DomainsInformation and Computation, 2000
- Characterizing finite Kripke structures in propositional temporal logicTheoretical Computer Science, 1988
- On Communicating Finite-State MachinesJournal of the ACM, 1983
- Recursivite et cones rationnels fermes par intersectionCalcolo, 1978
- Some decision problems related to the reachability problem for Petri netsTheoretical Computer Science, 1976