Deciding safety and liveness in TPTL

DOI10.1016/J.IPL.2014.06.005zbMATH Open1371.68101OpenAlexW2127730150MaRDI QIDQ402360FDOQ402360

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

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 complexityformal methodsreal-time systemstemporal 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)

Cites Work

• Title not available (Why is that?)
• The complexity of propositional linear temporal logics
• A really temporal logic
• A brief account of runtime verification
• Safety, liveness and fairness in temporal logic
• Decidable fragments of first-order temporal logics
• Model checking of safety properties
• Defining liveness
• Proving the Correctness of Multiprocess Programs

Cited In (3)

• On relative and probabilistic finite counterability
• Spanning the Spectrum from Safety to Liveness
• On monitoring linear temporal properties

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402360)