Automatic discovery of fair paths in infinite-state transition systems
From MaRDI portal
(Redirected from Publication:2147176)
Recommendations
- Proving the existence of fair paths in infinite-state systems
- Diagnosability of fair transition systems
- Fairness for Infinite-State Systems
- Publication:3687727
- Logic for Programming, Artificial Intelligence, and Reasoning
- Publication:4259992
- Publication:4828478
- Publication:3787456
- Program refinement in fair transition systems
- Fairness for pushdown automata.
Cites work
- scientific article; zbMATH DE number 7561611 (Why is no real title available?)
- A compositional approach to CTL\(^*\) verification
- Formal Methods for the Design of Real-Time Systems
- Geometric nontermination arguments
- Infinite-state liveness-to-safety via implicit abstraction and well-founded relations
- Model checking with strong fairness
- Proving non-termination
- Proving termination of programs automatically with AProVE
- Proving the existence of fair paths in infinite-state systems
- Ranking Templates for Linear Loops
- SMT-based induction methods for timed systems
- Temporal property verification as a program analysis task
- Termination of triangular Integer loops is decidable
- The MathSAT5 SMT solver
- Two Consequences of the Transposition Theorem on Linear Inequalities
- Verifying increasingly expressive temporal logics for infinite-state systems
Cited in
(3)
Describes a project that uses
Uses Software
This page was built for publication: Automatic discovery of fair paths in infinite-state transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147176)
