scientific article; zbMATH DE number 7056237
From MaRDI portal
Joël Ouaknine, Hsi-Ming Ho, James Worrell
Publication date: 17 May 2019
Full work available at URL: https://arxiv.org/abs/1803.02653
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of temporal logic over the reals
- Scalable offline monitoring of temporal specifications
- On regular temporal logics with past
- Recognizing safety and liveness
- A theory of timed automata
- An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
- \textsc{MightyL}: a compositional translation from MITL to timed automata
- A brief account of runtime verification
- Verifying Temporal Properties in Real Models
- On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing
- On Construction of Safety Signal Automata for $MITL[\:\mathcal{U},\:\mathcal{S}$ Using Temporal Projections]
- Time-Bounded Verification
- From MITL to Timed Automata
- On the Expressiveness of MTL with Past Operators
- Some Recent Results in Metric Temporal Logic
- Comparing LTL Semantics for Runtime Verification
- Temporal Logics over Linear Time Domains Are in PSPACE
- Towards a Theory of Time-Bounded Verification
- From Mtl to Deterministic Timed Automata
- When Are Timed Automata Determinizable?
- LTL Path Checking Is Efficiently Parallelizable
- The complexity of propositional linear temporal logics
- The benefits of relaxing punctuality
- On Safety Properties and Their Monitoring
- On the Complexity of Temporal-Logic Path Checking
- What good are digital clocks?
- Expressive Completeness for Metric Temporal Logic
- Alternating timed automata
- State-complexity of finite-state devices, state compressibility and incompressibility
- Expressiveness of Metric modalities for continuous time
- Fault Diagnosis for Timed Automata
- Mathematical Foundations of Computer Science 2003
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Formal Methods for the Design of Real-Time Systems
- On MITL and Alternating Timed Automata over Infinite Words
- An Expressive Temporal Logic for Real Time
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Formal Modeling and Analysis of Timed Systems
- Foundations of Software Science and Computation Structures
- CONCUR 2003 - Concurrency Theory
- Computer Aided Verification
- Model checking of safety properties
