Deciding safety and liveness in TPTL

DOI10.1016/j.ipl.2014.06.005zbMath1371.68101OpenAlexW2127730150MaRDI QIDQ402360

Carlos Cotrini Jiménez, Felix Klaedtke, Eugen Zălinescu, David A. Basin

Publication date: 28 August 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.06.005

zbMATH Keywords

verificationcomputational complexityreal-time systemsformal methodstemporal logicsafety and liveness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (2)

On monitoring linear temporal properties ⋮ On relative and probabilistic finite counterability

Cites Work

• Unnamed Item
• Defining liveness
• Safety, liveness and fairness in temporal logic
• Decidable fragments of first-order temporal logics
• A brief account of runtime verification
• The complexity of propositional linear temporal logics
• Proving the Correctness of Multiprocess Programs
• A really temporal logic
• Model checking of safety properties

This page was built for publication: Deciding safety and liveness in TPTL