Synthesis for continuous time

DOI10.1016/j.tcs.2015.06.032zbMath1328.68126OpenAlexW563910258MaRDI QIDQ2355696

Tim French, John C. McCabe-Dansted, M. A. Reynolds

Publication date: 24 July 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.032

zbMATH Keywords

synthesistemporal logicreal-number time

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items

THE TEMPORAL LOGIC OF TWO DIMENSIONAL MINKOWSKI SPACETIME IS DECIDABLE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of temporal logic over the reals
• The decision problem for linear temporal logic
• An axiomatization for until and since over the reals without the IRR rule
• The complexity of the temporal logic with ``until over general linear time
• A tableau for general linear temporal logic
• Indiscrete Models: Model Building and Model Checking over Linear Time
• Polynomial Space Counting Problems
• Rabin's uniformization problem
• Temporal Logics over Linear Time Domains Are in PSPACE
• An Axiomatization of the Temporal Logic with Until and Since over the Real Numbers
• On the elementary theory of linear order
• $ℵ_0$-categoricity of linear orderings
• Solving Sequential Conditions by Finite-State Strategies
• Decidability of Second-Order Theories and Automata on Infinite Trees