Realizability of Real-Time Logics
From MaRDI portal
Publication:3648828
DOI10.1007/978-3-642-04368-0_12zbMath1262.68117OpenAlexW1919217118MaRDI QIDQ3648828
J. Reichert, Laurent Doyen, Gilles Geeraerts, Jean-François Raskin
Publication date: 1 December 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04368-0_12
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (4)
Timed hyperproperties ⋮ Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\) ⋮ Distributed Event Clock Automata ⋮ Realizability of Schedules by Stochastic Time Petri Nets with Blocking Semantics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Event-clock automata: a determinizable class of timed automata
- A theory of timed automata
- Undecidable problems in unreliable computations.
- Timed Control with Observation Based and Stuttering Invariant Strategies
- Temporal Verification of Reactive Systems: Response
- An Antichain Algorithm for LTL Realizability
- A really temporal logic
- The benefits of relaxing punctuality
- On the synthesis of discrete controllers for timed systems
- On the decidability and complexity of Metric Temporal Logic over finite words
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- On Synthesizing Controllers from Bounded-Response Properties
- Controller Synthesis for MTL Specifications
- CONCUR 2005 – Concurrency Theory
- Formal Modeling and Analysis of Timed Systems
- CONCUR 2003 - Concurrency Theory
This page was built for publication: Realizability of Real-Time Logics
