On the public citation graph
State clock logic: A decidable real-time logic
0 signed · 78 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.1007/3-540-51803-7_19openalex-snapshot
Comparing linear and branching time temporal logics
inferredcites →https://doi.org/10.1007/3-540-56283-4openalex-snapshot
Specifying Message Passing and Time-Critical Systems with Temporal Logic
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-58485-4_43openalex-snapshot
Verification of linear hybrid systems by means of convex approximations
inferredcites →https://doi.org/10.1007/3-540-60218-6_40openalex-snapshot
Temporal logic + timed automata: Expressiveness and decidability
inferredcites →https://doi.org/10.1007/978-0-387-34892-6_1openalex-snapshot
Simple On-the-fly Automatic Verification of Linear Temporal Logic
inferredcites →https://doi.org/10.1007/978-1-4612-4222-2openalex-snapshot
Temporal Verification of Reactive Systems
inferredcites →https://doi.org/10.1007/bfb0014711openalex-snapshot
State clock logic: A decidable real-time logic
inferredcites →https://doi.org/10.1007/bfb0031988openalex-snapshot
Logics and models of real time: A survey
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.50021-4openalex-snapshot
Temporal and Modal Logic
inferredcites →https://doi.org/10.1109/lics.1990.113766openalex-snapshot
Model-checking for real-time systems
inferredcites →https://doi.org/10.1109/lics.1990.113767openalex-snapshot
Symbolic model checking: 10/sup 20/ states and beyond
inferredcites →https://doi.org/10.1109/real.1994.342724openalex-snapshot
The generalized railroad crossing: a case study in formal verification of real-time systems
inferredcites →https://doi.org/10.1145/112600.112613openalex-snapshot
The benefits of relaxing punctuality
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
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/11901433_41openalex-snapshot
SALT—Structured Assertion Language for Temporal Logic
inferred← citeshttps://doi.org/10.1007/11944836_25openalex-snapshot
Monitoring of Real-Time Properties
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-44585-4_48openalex-snapshot
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_59openalex-snapshot
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
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-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/978-3-031-16014-1_49openalex-snapshot
An Automatic Refinement for Event-B Through Annotated Temporal Logic Patterns
inferred← citeshttps://doi.org/10.1007/978-3-031-17715-6_9openalex-snapshot
Spatial and Timing Properties in Highway Traffic
inferred← citeshttps://doi.org/10.1007/978-3-031-40132-9_11openalex-snapshot
Time for Traffic Manoeuvres
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-24727-2_25openalex-snapshot
On Recognizable Timed Languages
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-85778-5_1openalex-snapshot
Some Recent Results in Metric Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_33openalex-snapshot
Impartial Anticipation in Runtime-Verification
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-14162-1_3openalex-snapshot
Towards a Theory of Time-Bounded Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-20398-5_3openalex-snapshot
The Theory and Practice of SALT
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-642-24270-0_18openalex-snapshot
Verifying Functional Behaviors of Automotive Products in EAST-ADL2 Using UPPAAL-PORT
inferred← citeshttps://doi.org/10.1007/978-3-642-41036-9_8openalex-snapshot
Deciding Continuous-Time Metric Temporal Logic with Counting Modalities
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/s007660050005openalex-snapshot
Scenario-Based Techniques for Supporting the Elaboration and the Validation of Formal Requirements
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/s10703-011-0140-2openalex-snapshot
Interrupt Timed Automata: verification and expressiveness
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.scico.2014.06.011openalex-snapshot
Contracts-refinement proof system for component-based embedded systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00308-xopenalex-snapshot
Axioms for real-time logics
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00432-2openalex-snapshot
Generalized discrete timed automata: decidable approximations for safety verification
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00485-1openalex-snapshot
Presburger liveness verification of discrete timed automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00743-0openalex-snapshot
Pushdown timed automata: a binary reachability characterization and safety verification
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80480-8openalex-snapshot
Interval Duration Logic
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.1109/aswec.2006.36openalex-snapshot
Model-based runtime analysis of distributed reactive systems
inferred← citeshttps://doi.org/10.1109/csf61375.2024.00032openalex-snapshot
Deciding Branching Hyperproperties for Real Time Systems
inferred← citeshttps://doi.org/10.1109/jsyst.2016.2614599openalex-snapshot
Efficient and Scalable Runtime Monitoring for Cyber–Physical System
inferred← citeshttps://doi.org/10.1109/lics.2005.33openalex-snapshot
On the Decidability of Metric Temporal Logic
inferred← citeshttps://doi.org/10.1109/tse.2005.131openalex-snapshot
A scenario-matching approach to the description and model checking of real-time properties
inferred← citeshttps://doi.org/10.1142/s0129054102001539openalex-snapshot
THE EXISTENCE OF ω-CHAINS FOR TRANSITIVE MIXED LINEAR RELATIONS AND ITS APPLICATIONS
inferred← citeshttps://doi.org/10.1145/3286976openalex-snapshot
From Real-time Logic to Timed Automata
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.25100/iyc.v15i2.2599openalex-snapshot
Modelamiento y especificación de sistemas distribuidos y temporizados
inferred← citeshttps://doi.org/10.3217/jucs-005-09-0574openalex-snapshot
Decomposition of Timed Automata
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.395.9openalex-snapshot
Enforcing Timing Properties in Motorway Traffic
showing the first 56 of 57 · page through all 57
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.