Well (and Better) Quasi-Ordered Transition Systems

DOI10.2178/bsl/1294171129zbMath1207.68219OpenAlexW2050591418MaRDI QIDQ3067860

Parosh Aziz Abdulla

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

zbMATH Keywords

Petri netsmodels with infinite-state spacessymbolic backward reachability analysiswell quasi-ordered transition systemswell-quasi ordering

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (8)

Delay-bounded scheduling without delay! ⋮ Attributed transition systems with hidden transitions ⋮ Analysis of the structure of attributed transition systems without hidden transitions ⋮ Unnamed Item ⋮ Lost in abstraction: monotonicity in multi-threaded programs ⋮ Unbounded-Thread Program Verification using Thread-State Equations ⋮ Carrying Probabilities to the Infinite World ⋮ MONOTONIC ABSTRACTION FOR PROGRAMS WITH MULTIPLY-LINKED STRUCTURES

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

This page was built for publication: Well (and Better) Quasi-Ordered Transition Systems