Spanning the spectrum from safety to liveness
From MaRDI portal
Publication:1629750
DOI10.1007/s00236-017-0307-4zbMath1408.68096OpenAlexW2913012649MaRDI QIDQ1629750
Publication date: 12 December 2018
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-017-0307-4
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Cites Work
- Another glance at the Alpern-Schneider characterization of safety and liveness in concurrent executions
- Defining liveness
- Recognizing safety and liveness
- Space-bounded reducibility among combinatorial problems
- Reasoning about infinite computations
- Safety, liveness and fairness in temporal logic
- Alternative semantics for temporal logics
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
- On Bounded Specifications
- An Antichain Algorithm for LTL Realizability
- The complexity of propositional linear temporal logics
- The complexity of probabilistic verification
- A Framework for Ranking Vacuity Results
- Decision problems forω-automata
- Depth-First Search and Linear Graph Algorithms
- Model checking of safety properties
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item