On the public citation graph

An Expressive Temporal Logic for Real Time

https://doi.org/10.1007/11821069_43
0 signed · 47 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/11753728_23openalex-snapshot
Expressiveness of Metric Modalities for Continuous Time
inferredcites →https://doi.org/10.1007/3-540-28788-4openalex-snapshot
Finite Model Theory
inferredcites →https://doi.org/10.1007/3-540-45694-5_4openalex-snapshot
Expressive Power of Temporal Logics
inferredcites →https://doi.org/10.1007/3-540-48168-0_13openalex-snapshot
Quantitative Temporal Logic
inferredcites →https://doi.org/10.1007/3-540-48523-6_39openalex-snapshot
A Framework for Decidable Metrical Logics
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/3-540-63246-8_8openalex-snapshot
Ehrenfeucht games, the composition method, and the monadic theory of ordinal words
inferredcites →https://doi.org/10.1007/bf01191722openalex-snapshot
Models for reactivity
inferredcites →https://doi.org/10.1007/bfb0013976openalex-snapshot
Temporal Logic
inferredcites →https://doi.org/10.1007/bfb0031988openalex-snapshot
Logics and models of real time: A survey
inferredcites →https://doi.org/10.1007/bfb0055640openalex-snapshot
It's about time: Real-time logics reviewed
inferredcites →https://doi.org/10.1016/0022-0000(78)90049-1openalex-snapshot
The dot-depth hierarchy of star-free languages is infinite
inferredcites →https://doi.org/10.1016/j.apal.2003.11.002openalex-snapshot
Algorithmic uses of the Feferman–Vaught Theorem
inferredcites →https://doi.org/10.1016/j.ic.2004.12.002openalex-snapshot
Timer formulas and decidable metric temporal logic
inferredcites →https://doi.org/10.1017/9781316717158openalex-snapshot
Model-Theoretic Logics
inferredcites →https://doi.org/10.1017/9781316717158.019openalex-snapshot
Monadic Second-Order Theories
inferredcites →https://doi.org/10.1112/s0024609396222416openalex-snapshot
FINITE MODEL THEORY (Perspectives in Mathematical Logic)
inferredcites →https://doi.org/10.1145/112600.112613openalex-snapshot
The benefits of relaxing punctuality
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
inferredcites →https://doi.org/10.2168/lmcs-3(1:3)2007openalex-snapshot
Expressiveness of Metric modalities for continuous time
inferredcites →https://doi.org/10.2307/1971037openalex-snapshot
The Monadic Theory of Order
inferredcites →https://doi.org/10.4064/fm-47-1-57-103openalex-snapshot
The first order properties of products of algebraic systems
inferredcites →https://doi.org/10.4064/fm-49-2-129-141openalex-snapshot
An application of games to the completeness problem for formalized theories

What points at this work

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

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-032-22752-2_24openalex-snapshot
MightyPPL: Model Checking MITL with Past and Pnueli Modalities
inferred← citeshttps://doi.org/10.1007/978-3-319-63387-9_21openalex-snapshot
MightyL: A Compositional Translation from MITL to Timed Automata
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-85778-5openalex-snapshot
Formal Modeling and Analysis of Timed Systems
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_16openalex-snapshot
Memory Event Clocks
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-49630-5_20openalex-snapshot
Metric Temporal Logic with Counting
inferred← citeshttps://doi.org/10.1007/s00236-015-0243-0openalex-snapshot
Metric temporal logic revisited
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.2019.104502openalex-snapshot
SMT-based satisfiability of first-order LTL with event freezing functions and metric operators
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105268openalex-snapshot
Metric quantifiers and counting in timed logics and automata
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.1109/time.2013.17openalex-snapshot
A New Metric Temporal Logic for Hybrid Systems
inferred← citeshttps://doi.org/10.1145/3286976openalex-snapshot
From Real-time Logic to Timed Automata
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.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.concur.2018.39openalex-snapshot
Büchi-Kamp Theorems for 1-clock ATA
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.1512.09032openalex-snapshot
Metric Temporal Logic with Counting
inferred← citeshttps://doi.org/10.48550/arxiv.2107.12986openalex-snapshot
Logics Meet 2-Way 1-Clock Alternating Timed Automata
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.