Automatic discovery of fair paths in infinite-state transition systems
From MaRDI portal
Publication:2147176
DOI10.1007/978-3-030-88885-5_3zbMATH Open1497.68290OpenAlexW3207031131MaRDI QIDQ2147176FDOQ2147176
Authors: Alessandro Cimatti, Alberto Griggio, Enrico Magnago 
Publication date: 22 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-88885-5_3
Recommendations
- Proving the existence of fair paths in infinite-state systems
- Diagnosability of fair transition systems
- Fairness for Infinite-State Systems
- scientific article; zbMATH DE number 3911720
- Logic for Programming, Artificial Intelligence, and Reasoning
- scientific article; zbMATH DE number 1332671
- scientific article; zbMATH DE number 2117131
- scientific article; zbMATH DE number 4050966
- Program refinement in fair transition systems
- Fairness for pushdown automata.
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cites Work
- Formal Methods for the Design of Real-Time Systems
- The MathSAT5 SMT solver
- Geometric nontermination arguments
- A compositional approach to CTL\(^*\) verification
- Temporal property verification as a program analysis task
- Proving non-termination
- Infinite-state liveness-to-safety via implicit abstraction and well-founded relations
- Two Consequences of the Transposition Theorem on Linear Inequalities
- Title not available (Why is that?)
- Ranking Templates for Linear Loops
- Termination of triangular Integer loops is decidable
- Model checking with strong fairness
- Proving the existence of fair paths in infinite-state systems
- Proving termination of programs automatically with AProVE
- Verifying increasingly expressive temporal logics for infinite-state systems
- SMT-based induction methods for timed systems
Cited In (3)
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)
