Verification by augmented finitary abstraction
From MaRDI portal
Publication:1854391
DOI10.1006/inco.2000.3000zbMath1003.68069OpenAlexW2027755003MaRDI QIDQ1854391
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/587de3dbdb718dbebd02a1a6fd8483538bf0e346
Related Items (18)
Dynamic input/output automata: a formal and compositional model for dynamic systems ⋮ Abstraction and Abstraction Refinement ⋮ An invariant-based approach to the verification of asynchronous parameterized networks ⋮ Augmented finite transition systems as abstractions for control synthesis ⋮ Verification of multi-linked heaps ⋮ Synthesis of Reactive(1) designs ⋮ Equational abstractions ⋮ Bridging the gap between fair simulation and trace inclusion ⋮ A compositional approach to CTL\(^*\) verification ⋮ Verification by augmented abstraction: The automata-theoretic view ⋮ Smaller Abstractions for ∀CTL* without Next ⋮ Model checking with strong fairness ⋮ GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic ⋮ Counter Abstraction in the CSP/FDR setting ⋮ Tool support for learning Büchi automata and linear temporal logic ⋮ Dynamic Reactive Modules ⋮ On the refinement of liveness properties of distributed systems ⋮ MODULAR RANKING ABSTRACTION
Cites Work
- The \(\mu\)-calculus as an assertion-language for fairness arguments
- Completing the temporal picture
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Reasoning about infinite computations
- Property preserving abstractions for the verification of concurrent systems
- Verification of concurrent programs: The automata-theoretic framework
- Generalized temporal verification diagrams
- Synthesis of Communicating Processes from Temporal Logic Specifications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Verification by augmented finitary abstraction
