On the public citation graph
It's about time: Real-time logics reviewed
0 signed · 110 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1993.1024openalex-snapshot
Model-Checking in Dense Real-Time
inferredcites →https://doi.org/10.1006/inco.1993.1025openalex-snapshot
Real-Time Logics: Complexity and Expressiveness
inferredcites →https://doi.org/10.1006/inco.1994.1045openalex-snapshot
Symbolic Model Checking for Real-Time Systems
inferredcites →https://doi.org/10.1006/inco.1994.1092openalex-snapshot
Reasoning about Infinite Computations
inferredcites →https://doi.org/10.1007/3-540-58179-0_39openalex-snapshot
A determinizable class of timed automata
inferredcites →https://doi.org/10.1007/3-540-58468-4_191openalex-snapshot
Specifying timed state sequences in powerful decidable logics and timed automata
inferredcites →https://doi.org/10.1007/978-1-4612-0931-7openalex-snapshot
The Temporal Logic of Reactive and Concurrent Systems
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_23openalex-snapshot
On a Decision Method in Restricted Second Order Arithmetic
inferredcites →https://doi.org/10.1007/bf01995674openalex-snapshot
Specifying real-time properties with metric temporal logic
inferredcites →https://doi.org/10.1007/bfb0014711openalex-snapshot
State clock logic: A decidable real-time logic
inferredcites →https://doi.org/10.1007/bfb0025786openalex-snapshot
Synthesis of communicating processes from Temporal Logic specifications
inferredcites →https://doi.org/10.1007/bfb0031988openalex-snapshot
Logics and models of real time: A survey
inferredcites →https://doi.org/10.1007/bfb0031992openalex-snapshot
Real-time and the Mu-Calculus (preliminary report)
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50021-4openalex-snapshot
Temporal and Modal Logic
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1109/sfcs.1988.21948openalex-snapshot
On the complexity of omega -automata
inferredcites →https://doi.org/10.1109/sfcs.1992.267774openalex-snapshot
Back to the future: towards a theory of timed regular languages
inferredcites →https://doi.org/10.1145/112600.112613openalex-snapshot
The benefits of relaxing punctuality
inferredcites →https://doi.org/10.1145/318593.318622openalex-snapshot
Checking that finite state concurrent programs satisfy their linear specification
inferredcites →https://doi.org/10.1145/357233.357237openalex-snapshot
Synthesis of Communicating Processes from Temporal Logic Specifications
inferredcites →https://doi.org/10.1145/3828.3837openalex-snapshot
The complexity of propositional linear temporal logics
inferredcites →https://doi.org/10.1145/512644.512660openalex-snapshot
A really abstract concurrent model and its temporal logic
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-8176-4404-0_21openalex-snapshot
An Introduction to Hybrid Automata
inferred← citeshttps://doi.org/10.1007/11562948_12openalex-snapshot
Quantitative and Qualitative Analysis of Temporal Aspects of Complex Activities
inferred← citeshttps://doi.org/10.1007/11590156_35openalex-snapshot
On the Expressiveness of TPTL and MTL
inferred← citeshttps://doi.org/10.1007/11603009_2openalex-snapshot
Real Time Temporal Logic: Past, Present, Future
inferred← citeshttps://doi.org/10.1007/11690634_15openalex-snapshot
On Metric Temporal Logic and Faulty Turing Machines
inferred← citeshttps://doi.org/10.1007/11691372_27openalex-snapshot
Safety Metric Temporal Logic Is Fully Decidable
inferred← citeshttps://doi.org/10.1007/11753728_23openalex-snapshot
Expressiveness of Metric Modalities for Continuous Time
inferred← citeshttps://doi.org/10.1007/11821069_43openalex-snapshot
An Expressive Temporal Logic for Real Time
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_60openalex-snapshot
Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_11openalex-snapshot
A Decidable Dense Branching-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-45352-0_23openalex-snapshot
An On-the-Fly Tableau Construction for a Real-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-45931-6_19openalex-snapshot
On Model Checking Durational Kripke Structures
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_5openalex-snapshot
Product Interval Automata: A Subclass of Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_7openalex-snapshot
Decidable classes of the verification problem in a timed predicate logic
inferred← citeshttps://doi.org/10.1007/978-1-4020-6254-4_6openalex-snapshot
All Those Duration Calculi: An Integrated Approach
inferred← citeshttps://doi.org/10.1007/978-1-84882-912-1_13openalex-snapshot
On Process-Algebraic Extensions of Metric Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-48006-6_16openalex-snapshot
The Expressive Power of Temporal and First-Order Metric Logics
inferred← citeshttps://doi.org/10.1007/978-3-030-88494-9_5openalex-snapshot
On the Specification and Monitoring of Timed Normative Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_24openalex-snapshot
MightyPPL: Model Checking MITL with Past and Pnueli Modalities
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_25openalex-snapshot
Model Checking Timed Automata with One or Two Clocks
inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_12openalex-snapshot
Monitoring Temporal Properties of Continuous Signals
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_37openalex-snapshot
An Improved On-the-Fly Tableau Construction for a Real-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_11openalex-snapshot
Automated Verification of Dense-Time MTL Specifications Via Discrete-Time Approximation
inferred← citeshttps://doi.org/10.1007/978-3-540-68265-3_1openalex-snapshot
A Coordination Model for Service-Oriented Interactions
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_11openalex-snapshot
On Expressiveness and Complexity in Real-Time Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-75454-1_4openalex-snapshot
Undecidability of Universality for Timed Automata with Minimal Resources
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_26openalex-snapshot
Checking Temporal Properties of Discrete, Timed and Continuous Behaviors
inferred← citeshttps://doi.org/10.1007/978-3-540-85778-5openalex-snapshot
Formal Modeling and Analysis of Timed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-85778-5_1openalex-snapshot
Some Recent Results in Metric Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-85778-5_8openalex-snapshot
Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
inferred← citeshttps://doi.org/10.1007/978-3-642-15297-9_13openalex-snapshot
From Mtl to Deterministic Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_57openalex-snapshot
Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian
inferred← citeshttps://doi.org/10.1007/978-3-8348-9703-9openalex-snapshot
Eigenschaftsorientierte Beschreibung der logischen Architektur eingebetteter Systeme
inferred← citeshttps://doi.org/10.1007/s10009-020-00585-wopenalex-snapshot
Formal testing of timed graph transformation systems using metric temporal graph logic
inferred← citeshttps://doi.org/10.1007/s10515-008-0027-7openalex-snapshot
Deriving event-based transition systems from goal-oriented requirements models
inferred← citeshttps://doi.org/10.1007/s11704-013-2195-2openalex-snapshot
A survey on temporal logics for specifying and verifying real-time systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.02.044openalex-snapshot
Model-checking Timed Temporal Logics
inferred← citeshttps://doi.org/10.1016/j.ic.2004.12.002openalex-snapshot
Timer formulas and decidable metric temporal logic
inferred← citeshttps://doi.org/10.1016/j.ic.2006.11.002openalex-snapshot
Temporal logics with incommensurable distances are undecidable
inferred← citeshttps://doi.org/10.1016/j.ic.2009.10.004openalex-snapshot
On the expressiveness of TPTL and MTL
inferred← citeshttps://doi.org/10.1016/j.ic.2011.11.003openalex-snapshot
Continuous time temporal logic with counting
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.020openalex-snapshot
Efficient timed model checking for discrete-time systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.03.017openalex-snapshot
Complexity of metric temporal logics with counting and the Pnueli modalities
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00049-5openalex-snapshot
A first order logic for specification of timed algorithms: basic properties and a decidable class
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00186-4openalex-snapshot
Decidable verification for reducible timed automata specified in a first order logic with time
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00163-9openalex-snapshot
Future temporal logic needs infinitely many modalities
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)81050-8openalex-snapshot
Runtime Verification of Timed LTL using Disjunctive Normalized Equation Systems
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03012-xopenalex-snapshot
Chapter 12 Temporal Representation and Reasoning
inferred← citeshttps://doi.org/10.1080/03081070701794876openalex-snapshot
Expressiveness of verifiable hierarchical clock systems
inferred← citeshttps://doi.org/10.1109/coase.2018.8560421openalex-snapshot
Online-Monitoring Autonomous Transport Robots with an R-valued Temporal Logic
inferred← citeshttps://doi.org/10.1109/ecrts.2004.15openalex-snapshot
Integrating model-based design and preemptive scheduling in mixed time- and event-triggered systems
inferred← citeshttps://doi.org/10.1109/iceccs.2013.19openalex-snapshot
An Adequate Logic for Heterogeneous Systems
inferred← citeshttps://doi.org/10.1109/icsmc.2000.884356openalex-snapshot
Formal methods in PLC programming
inferred← citeshttps://doi.org/10.1109/lics.2005.33openalex-snapshot
On the Decidability of Metric Temporal Logic
inferred← citeshttps://doi.org/10.1109/lics.2013.41openalex-snapshot
Expressive Completeness for Metric Temporal Logic
inferred← citeshttps://doi.org/10.1109/tsmc.2014.2303051openalex-snapshot
A Metric Temporal Logic Specification Interface for Real-Time Discrete-Event Control
inferred← citeshttps://doi.org/10.1145/1081706.1081719openalex-snapshot
Fluent temporal logic for discrete-time event-based models
inferred← citeshttps://doi.org/10.1145/1086228.1086291openalex-snapshot
Passive mid-stream monitoring of real-time properties
inferred← citeshttps://doi.org/10.1145/1342991.1342996openalex-snapshot
Durations and parametric model-checking in timed automata
inferred← citeshttps://doi.org/10.1145/3286976openalex-snapshot
From Real-time Logic to Timed Automata
inferred← citeshttps://doi.org/10.1504/ijccbs.2014.059593openalex-snapshot
A formal framework to specify and verify real-time properties on critical systems
inferred← citeshttps://doi.org/10.1587/transfun.e92.a.2781openalex-snapshot
Model Checking of Real-Time Properties of Resource-Bound Process Algebra
inferred← citeshttps://doi.org/10.2168/lmcs-3(1:3)2007openalex-snapshot
Expressiveness of Metric modalities for continuous time
inferred← citeshttps://doi.org/10.2168/lmcs-3(1:8)2007openalex-snapshot
On the decidability and complexity of Metric Temporal Logic over finite words
inferred← citeshttps://doi.org/10.24963/ijcai.2021/287openalex-snapshot
Transforming Robotic Plans with Timed Automata to Solve Temporal Platform Constraints
inferred← citeshttps://doi.org/10.3929/ethz-a-004317368openalex-snapshot
Hardware-in-the-loop simulation framework
inferred← citeshttps://doi.org/10.4230/lipics.csl.2013.380openalex-snapshot
When is Metric Temporal Logic Expressively Complete?
inferred← citeshttps://doi.org/10.48550/arxiv.1208.4993openalex-snapshot
Expressive Completeness of Metric Temporal Logic
inferred← citeshttps://doi.org/10.70675/77ea8727z9983z49f1zb2dfzc928ed49379aopenalex-snapshot
Traceability of concerns and observer-based verification for railway safety-critical software
inferred← citeshttps://doi.org/10.70675/c2fa60a8z2c6az49e1z9936z1664a50323abopenalex-snapshot
Méthodologie pour les études d’automatisation et la génération automatique de programmes Automates Programmables Industrielssûrs de fonctionnement. Application aux Equipements d’Alimentation des Lignes Électrifiées
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.