Realizability of real-time logics

DOI10.1007/978-3-642-04368-0_12MaRDI QIDQ3648828zbMATH OpenOpenAlexFDO

Authors Laurent Doyen, G. Geeraerts, J. Reichert, 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

Mathematics Subject Classification ID

Temporal logic (03B44) Automata and formal grammars in connection with logical questions (03D05) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1304994
• On Expressiveness and Complexity in Real-Time Model Checking
• Real-time synthesis is hard!
• A really temporal logic
• scientific article; zbMATH DE number 1304997

Cites work

• A really temporal logic
• A theory of timed automata
• An Antichain Algorithm for LTL Realizability
• CONCUR 2005 – Concurrency Theory
• Controller Synthesis for MTL Specifications
• Event-clock automata: a determinizable class of timed automata
• Formal Modeling and Analysis of Timed Systems
• From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
• scientific article; zbMATH DE number 3937153 (Why is no real title available?)
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 1256652 (Why is no real title available?)
• scientific article; zbMATH DE number 1304994 (Why is no real title available?)
• On Synthesizing Controllers from Bounded-Response Properties
• On the decidability and complexity of Metric Temporal Logic over finite words
• On the synthesis of discrete controllers for timed systems
• Temporal verification of reactive systems: response
• The benefits of relaxing punctuality
• The element of surprise in timed games.
• Timed Control with Observation Based and Stuttering Invariant Strategies
• Undecidable problems in unreliable computations.

Cited in

(20)

• Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\)
• Realizability of schedules by stochastic time Petri nets with blocking semantics
• Advances in Parametric Real-Time Reasoning
• Timed context-free temporal logics
• Decidability and Expressive Power of Real Time Logics
• scientific article; zbMATH DE number 1304994 (Why is no real title available?)
• scientific article; zbMATH DE number 1324668 (Why is no real title available?)
• Real-time synthesis is hard!
• scientific article; zbMATH DE number 2112984 (Why is no real title available?)
• scientific article; zbMATH DE number 770153 (Why is no real title available?)
• scientific article; zbMATH DE number 1400049 (Why is no real title available?)
• Distributed event clock automata (extended abstract)
• Real-Time Definable Languages
• A real-time interval logic and its decision procedure
• Axioms for real-time logics
• Boolean abstractions for realizability modulo theories
• Taming large bounds in synthesis from bounded-liveness specifications
• Interval logics and their decision procedures. II: A real-time interval logic
• Reasoning about real-time repetitions: Terminating and nonterminating
• Timed hyperproperties

This page was built for publication: Realizability of real-time logics

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