On the public citation graph
The regular real-time languages
0 signed · 116 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.1025openalex-snapshot
Real-Time Logics: Complexity and Expressiveness
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-4613-8928-6_23openalex-snapshot
On a Decision Method in Restricted Second Order Arithmetic
inferredcites →https://doi.org/10.1007/bfb0014711openalex-snapshot
State clock logic: A decidable real-time logic
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1109/lics.1997.614944openalex-snapshot
A Kleene theorem for timed automata
inferredcites →https://doi.org/10.1109/sfcs.1983.51openalex-snapshot
Reasoning about infinite computation paths
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/357233.357237openalex-snapshot
Synthesis of Communicating Processes from Temporal Logic Specifications
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/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/11817949_29openalex-snapshot
Inference of Event-Recording Automata Using Timed Decision Trees
inferred← citeshttps://doi.org/10.1007/11944836_34openalex-snapshot
On Continuous Timed Automata with Input-Determined Guards
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_17openalex-snapshot
An Algebraic Characterization of Data and Timed Languages
inferred← citeshttps://doi.org/10.1007/3-540-45352-0_20openalex-snapshot
A Logical Characterisation of Event Recording Automata
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_23openalex-snapshot
Real-Time Automata and the Kleene Algebra of Sets of Real Numbers
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_17openalex-snapshot
Kleene theorems for event-clock automata
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_39openalex-snapshot
A Framework for Decidable Metrical Logics
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-90870-6_10openalex-snapshot
Generalizing Non-punctuality for Timed Temporal Logic with Freeze Quantifiers
inferred← citeshttps://doi.org/10.1007/978-3-031-73751-0_12openalex-snapshot
Reminiscences of a Real-Time Researcher
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-319-10575-8_29openalex-snapshot
Model Checking Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-95582-7_9openalex-snapshot
The Compound Interest in Relaxing Punctuality
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_25openalex-snapshot
On Recognizable Timed Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_8openalex-snapshot
Algebraic Recognizability of Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-30080-9_1openalex-snapshot
Decision Problems for Timed Automata: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_26openalex-snapshot
Learning of Event-Recording Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_7openalex-snapshot
On Timed Automata with Input-Determined Guards
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_6openalex-snapshot
Model Checking: From Tools to Theory
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-75292-9_13openalex-snapshot
Distributed Time-Asynchronous Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-75454-1_8openalex-snapshot
Counter-Free Input-Determined Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-76292-8_34openalex-snapshot
Achieving, Satisficing, and Excelling
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-540-88194-0_19openalex-snapshot
Practical Automated Partial Verification of Multi-paradigm Real-Time Models
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_50openalex-snapshot
Event-Clock Visibly Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-02737-6_34openalex-snapshot
Weighted Timed MSO Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_33openalex-snapshot
Time-Bounded Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-04368-0_12openalex-snapshot
Realizability of Real-Time Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_3openalex-snapshot
Towards a Theory of Time-Bounded Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-15297-9_2openalex-snapshot
Safraless Procedures for Timed Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-19724-6_3openalex-snapshot
A CEP Babelfish: Languages for Complex Event Processing and Querying Surveyed
inferred← citeshttps://doi.org/10.1007/978-3-642-22256-6_23openalex-snapshot
Distributed Event Clock Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_7openalex-snapshot
A Logical Characterization of Timed (non-)Regular Languages
inferred← citeshttps://doi.org/10.1007/b100824openalex-snapshot
Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
inferred← citeshttps://doi.org/10.1007/bfb0055640openalex-snapshot
It's about time: Real-time logics reviewed
inferred← citeshttps://doi.org/10.1007/s00236-015-0229-yopenalex-snapshot
A tool for deciding the satisfiability of continuous-time metric temporal logic
inferred← citeshttps://doi.org/10.1007/s00446-011-0148-2openalex-snapshot
A study on shuffle, stopwatches and independently evolving clocks
inferred← citeshttps://doi.org/10.1007/s10009-005-0214-9openalex-snapshot
On the expressiveness of MTL in the pointwise and continuous semantics
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/s11704-013-2195-2openalex-snapshot
A survey on temporal logics for specifying and verifying real-time systems
inferred← citeshttps://doi.org/10.1016/j.cosrev.2013.05.001openalex-snapshot
A survey of timed automata for the development of real-time systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.02.062openalex-snapshot
Inference of Timed Transition Systems
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.2011.11.003openalex-snapshot
Continuous time temporal logic with counting
inferred← citeshttps://doi.org/10.1016/j.ic.2015.06.007openalex-snapshot
An SMT-based approach to satisfiability checking of MITL
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104502openalex-snapshot
SMT-based satisfiability of first-order LTL with event freezing functions and metric operators
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/j.tcs.2010.07.008openalex-snapshot
Learning of event-recording automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.07.020openalex-snapshot
A logical characterization of timed regular languages
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00229-6openalex-snapshot
A logical characterization of data languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00308-xopenalex-snapshot
Axioms for real-time logics
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00038-5openalex-snapshot
An algebraic approach to data languages and timed languages
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80672-8openalex-snapshot
Model-Generation of a Fictitious Clock Real-Time Logic Using Sharing Trees
inferred← citeshttps://doi.org/10.1023/b:form.0000026093.21513.31openalex-snapshot
Forward Analysis of Updatable Timed Automata
inferred← citeshttps://doi.org/10.1109/cdc.2008.4739366openalex-snapshot
Vehicle Routing Problem with Metric Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1109/csf61375.2024.00032openalex-snapshot
Deciding Branching Hyperproperties for Real Time Systems
inferred← citeshttps://doi.org/10.1109/lics.2004.1319630openalex-snapshot
A landscape with games in the background
inferred← citeshttps://doi.org/10.1109/lics.2005.33openalex-snapshot
On the Decidability of Metric Temporal Logic
inferred← citeshttps://doi.org/10.1109/lics.2010.45openalex-snapshot
Alternating Timed Automata over Bounded Time
inferred← citeshttps://doi.org/10.1109/lics.2013.41openalex-snapshot
Expressive Completeness for Metric Temporal Logic
inferred← citeshttps://doi.org/10.1109/tcad.2021.3101715openalex-snapshot
Migrating Assertions From Dense to Discrete Time
inferred← citeshttps://doi.org/10.1109/tii.2014.2307531openalex-snapshot
FTL-CFree: A Fuzzy Real-Time Language for Runtime Verification
inferred← citeshttps://doi.org/10.1109/time.2013.20openalex-snapshot
A Tool for Deciding the Satisfiability of Continuous-Time Metric Temporal Logic
inferred← citeshttps://doi.org/10.1145/3286976openalex-snapshot
From Real-time Logic to Timed Automata
inferred← citeshttps://doi.org/10.1145/3571749openalex-snapshot
From Non-punctuality to Non-adjacency: A Quest for Decidability of Timed Temporal Logics with Quantifiers
inferred← citeshttps://doi.org/10.14279/depositonce-743openalex-snapshot
Time Partition Testing | Systematischer Test des kontinuierlichen Verhaltens von eingebetteten Systemen
inferred← citeshttps://doi.org/10.2168/lmcs-10(4:17)2014openalex-snapshot
Quantified CTL: Expressiveness and Complexity
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.23638/lmcs-15(2:13)2019openalex-snapshot
On the Expressiveness and Monitoring of Metric Temporal Logic
inferred← citeshttps://doi.org/10.25100/iyc.v15i2.2599openalex-snapshot
Modelamiento y especificación de sistemas distribuidos y temporizados
inferred← citeshttps://doi.org/10.25596/jalc-2002-167openalex-snapshot
A Kleene/Büchi-Like Theorem for Clock Languages
inferred← citeshttps://doi.org/10.4204/eptcs.119.8openalex-snapshot
Deciding the Satisfiability of MITL Specifications
inferred← citeshttps://doi.org/10.4204/eptcs.256.14openalex-snapshot
Linear-time Temporal Logic with Event Freezing Functions
inferred← citeshttps://doi.org/10.4204/eptcs.408.5openalex-snapshot
When Do You Start Counting? Revisiting Counting and Pnueli Modalities in Timed Logics
inferred← citeshttps://doi.org/10.4230/lipics.csl.2013.380openalex-snapshot
When is Metric Temporal Logic Expressively Complete?
inferred← citeshttps://doi.org/10.4230/lipics.time.2019.20openalex-snapshot
On Verifying Timed Hyperproperties
inferred← citeshttps://doi.org/10.47749/t/unicamp.2003.293010openalex-snapshot
Grau de indecidibilidade da universidade para subclasses de automatos temporizados
inferred← citeshttps://doi.org/10.48550/arxiv.2107.12986openalex-snapshot
Logics Meet 2-Way 1-Clock Alternating Timed Automata
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0601096openalex-snapshot
On timed automata with input-determined guards
inferred← citeshttps://doi.org/10.5555/1784542.1784589openalex-snapshot
Achieving, satisficing, and excelling
inferred← citeshttps://doi.org/10.70675/f83ee450z166az402ezbb8bz7e17546e20f9openalex-snapshot
Temporal model to explore administrative healthcare databases
inferred← citeshttps://doi.org/10.7146/brics.v9i35.21750openalex-snapshot
Timed Automata May Cause Some Troubles
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.