On the public citation graph

Generalized quantitative temporal reasoning: An automata-theoretic approach

0 signed · 39 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.1007/3-540-15641-0openalex-snapshot
Automata on Infinite Words
inferredcites →https://doi.org/10.1007/3-540-60915-6openalex-snapshot
Logics for Concurrency
inferredcites →https://doi.org/10.1007/3-540-60915-6_3openalex-snapshot
Automated temporal reasoning about reactive 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/978-1-4615-3190-6_3openalex-snapshot
Symbolic Model Checking
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_17openalex-snapshot
On the Development of Reactive Systems
inferredcites →https://doi.org/10.1007/bfb0023727openalex-snapshot
Quantitative temporal reasoning
inferredcites →https://doi.org/10.1007/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
inferredcites →https://doi.org/10.1007/bfb0027047openalex-snapshot
Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends
inferredcites →https://doi.org/10.1007/bfb0031984openalex-snapshot
Real-Time: Theory in Practice
inferredcites →https://doi.org/10.1007/bfb0031988openalex-snapshot
Logics and models of real time: A survey
inferredcites →https://doi.org/10.1016/s0019-9958(83)80051-5openalex-snapshot
Temporal logic can be more expressive
inferredcites →https://doi.org/10.1109/lics.1995.523250openalex-snapshot
On the verification problem of nonregular properties for nonregular processes
inferredcites →https://doi.org/10.1109/sfcs.1977.32openalex-snapshot
The temporal logic of programs
inferredcites →https://doi.org/10.1109/sfcs.1994openalex-snapshot
Proceedings 35th Annual Symposium on Foundations of Computer Science
inferredcites →https://doi.org/10.1145/174644.174651openalex-snapshot
A really temporal logic
inferredcites →https://doi.org/10.1145/199448.199470openalex-snapshot
Verifying infinite state processes with sequential and parallel composition
inferredcites →https://doi.org/10.1145/318593.318622openalex-snapshot
Checking that finite state concurrent programs satisfy their linear specification
inferredcites →https://doi.org/10.7146/dpb.v8i94.6510openalex-snapshot
Specification and Verification of Concurrent Programs

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10719839_43openalex-snapshot
On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_35openalex-snapshot
Extended Temporal Logic Revisited
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-46002-0_21openalex-snapshot
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_18openalex-snapshot
Formula Based Abstractions of Transition Systems for Real-Time Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_15openalex-snapshot
Counting CTL
inferred← citeshttps://doi.org/10.1007/s10703-005-3399-3openalex-snapshot
Collecting Statistics Over Runtime Executions
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.2010.06.002openalex-snapshot
Linear Temporal Logic Symbolic Model Checking
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/s0304-3975(02)00644-8openalex-snapshot
On the expressivity and complexity of quantitative branching-time temporal logics
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80576-0openalex-snapshot
Collecting Statistics over Runtime Executions
inferred← citeshttps://doi.org/10.1023/a:1026534200187openalex-snapshot
Logic Based Abstractions of Real-Time Systems
inferred← citeshttps://doi.org/10.1109/hpcsim.2011.5999813openalex-snapshot
Meeting deadlines within object-oriented systems
inferred← citeshttps://doi.org/10.1109/lics.1999.782628openalex-snapshot
Parametric quantitative temporal reasoning
inferred← citeshttps://doi.org/10.1109/rtcsa.2010.28openalex-snapshot
Modeling of Real-Time System Designs for Parametric Analysis
inferred← citeshttps://doi.org/10.1109/time.2010.20openalex-snapshot
Counting LTL
inferred← citeshttps://doi.org/10.1145/1080334.1080337openalex-snapshot
The open family of temporal logics
inferred← citeshttps://doi.org/10.2168/lmcs-9(1:3)2013openalex-snapshot
Counting CTL
inferred← citeshttps://doi.org/10.4204/eptcs.243.2openalex-snapshot
Deterministic Temporal Logics and Interval Constraints
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.