A decidable timeout-based extension of linear temporal logic
DOI10.1080/11663081.2014.964491zbMath1398.03081OpenAlexW1627271069MaRDI QIDQ4583356
Publication date: 28 August 2018
Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/11663081.2014.964491
undecidabilitymodel checkingtemporal logicsreal-time logicsexpressiveness of logicstableau satisfiabilitytimeout constraintstimeout modelstiming properties
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)
Uses Software
Cites Work
- Real-time logics: Complexity and expressiveness
- Formal description techniques and protocol specification, testing and verification. FORTE XI/ PSTV XVIII '98. IFIP TC6 WG6. 1 joint international conference on Formal description techniques for distributed systems and communication protocols (FORTE XI) and protocol specification, testing and verification (PSTV XVIII), Paris, France, November 3--6, 1998
- A theory of timed automata
- Relationships between nondeterministic and deterministic tape complexities
- Timeout and Calendar Based Finite State Modeling and Verification of Real-Time Systems
- Some Recent Results in Metric Temporal Logic
- The complexity of propositional linear temporal logics
- A really temporal logic
- What good are digital clocks?
- Computer Aided Verification
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Formal Methods for the Design of Real-Time Systems
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Real-Time Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item