On the public citation graph

Real-time logics: Fictitious clock as an abstraction of dense time

0 signed · 29 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.
Claim with ORCID
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.
See reference health

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-55719-9_103openalex-snapshot
What good are digital clocks?
inferredcites →https://doi.org/10.1007/3-540-55844-6_142openalex-snapshot
Comparing the Galois connection and widening/narrowing approaches to abstract interpretation
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/978-0-387-34892-6_1openalex-snapshot
Simple On-the-fly Automatic Verification of Linear Temporal Logic
inferredcites →https://doi.org/10.1007/bfb0031988openalex-snapshot
Logics and models of real time: A survey
inferredcites →https://doi.org/10.1007/bfb0035387openalex-snapshot
Real-time logics: Fictitious clock as an abstraction of dense time
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50021-4openalex-snapshot
Temporal and Modal Logic
inferredcites →https://doi.org/10.1093/logcom/2.4.511openalex-snapshot
Abstract Interpretation Frameworks
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
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/sfcs.1977.32openalex-snapshot
The temporal logic of programs
inferredcites →https://doi.org/10.1145/174644.174651openalex-snapshot
A really temporal logic
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11560647_18openalex-snapshot
Symbolic Model Checking of Finite Precision Timed Automata
inferred← citeshttps://doi.org/10.1007/11940197_12openalex-snapshot
Robustness of Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1007/978-3-030-25540-4_24openalex-snapshot
StreamLAB: Stream-based Monitoring of Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-53291-8_3openalex-snapshot
RTLola Cleared for Take-Off: Monitoring Autonomous Aircraft
inferred← citeshttps://doi.org/10.1007/978-3-031-17196-3_21openalex-snapshot
Real-Time Visualization of Stream-Based Monitoring Data
inferred← citeshttps://doi.org/10.1007/978-3-642-29860-8_20openalex-snapshot
Algorithms for Monitoring Real-Time Properties
inferred← citeshttps://doi.org/10.1007/bfb0035375openalex-snapshot
Tools and Algorithms for the Construction and Analysis of Systems
inferred← citeshttps://doi.org/10.1007/s00236-017-0295-4openalex-snapshot
Algorithms for monitoring real-time properties
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.10.011openalex-snapshot
Adequacy and Complete Axiomatization for Timed Modal Logic
inferred← citeshttps://doi.org/10.1016/j.ifacol.2020.12.2539openalex-snapshot
Control of Timed Discrete Event Systems with Ticked Linear Temporal Logic Constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.06.021openalex-snapshot
Robustness of temporal logic specifications for continuous-time signals
inferred← citeshttps://doi.org/10.1360/jos170001openalex-snapshot
Reachability Checking of Finite Precision Timed Automata
showing the first 12 of 13 · page through all 13
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.