Well (and Better) Quasi-Ordered Transition Systems
From MaRDI portal
Publication:3067860
DOI10.2178/bsl/1294171129zbMath1207.68219MaRDI QIDQ3067860
Publication date: 13 January 2011
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/bsl/1294171129
Petri nets; models with infinite-state spaces; symbolic backward reachability analysis; well quasi-ordered transition systems; well-quasi ordering
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q42: Grammars and rewriting systems
Related Items
Analysis of the structure of attributed transition systems without hidden transitions, Lost in abstraction: monotonicity in multi-threaded programs, Delay-bounded scheduling without delay!, Attributed transition systems with hidden transitions, Unbounded-Thread Program Verification using Thread-State Equations, MONOTONIC ABSTRACTION FOR PROGRAMS WITH MULTIPLY-LINKED STRUCTURES, Unnamed Item, Carrying Probabilities to the Infinite World
Cites Work
- Symbolic model checking: \(10^{20}\) states and beyond
- A theory of timed automata
- Automata, languages and programming. 21st international colloquium, ICALP '94, Jerusalem, Israel, July 11--14, 1994. Proceedings
- Model checking of systems with many identical timed processes
- Algorithmic analysis of programs with well quasi-ordered domains.
- Forward analysis of updatable timed automata
- Verifying programs with unreliable channels
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Verification of Timed Automata via Satisfiability Checking
- Introduction to constraint databases
- Well-structured transition systems everywhere!
- Ensuring completeness of symbolic verification methods for infinite-state systems
