On the public citation graph
Difficult configurations — on the complexity of LTrL
0 signed · 56 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.1995.1078openalex-snapshot
A Logical Study of Distributed Transition Systems
inferredcites →https://doi.org/10.1006/inco.2001.2956openalex-snapshot
An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces
inferredcites →https://doi.org/10.1007/3-540-60761-7openalex-snapshot
Partial-Order Methods for the Verification of Concurrent Systems
inferredcites →https://doi.org/10.1007/3-540-61550-4_141openalex-snapshot
Partial order reduction: Model-checking using representatives
inferredcites →https://doi.org/10.1007/bf00709154openalex-snapshot
A stubborn attack on state explosion
inferredcites →https://doi.org/10.1007/bfb0055039openalex-snapshot
Deciding global partial-order properties
inferredcites →https://doi.org/10.1007/s10703-005-4592-0openalex-snapshot
Deciding Global Partial-Order Properties
inferredcites →https://doi.org/10.1016/0020-0190(92)90007-iopenalex-snapshot
On undecidability of propositional temporal logics on trace systems
inferredcites →https://doi.org/10.1016/0304-3975(94)90009-4openalex-snapshot
Proving partial order properties
inferredcites →https://doi.org/10.1016/0304-3975(95)00130-1openalex-snapshot
Logical definability on infinite traces
inferredcites →https://doi.org/10.1109/lics.1994.316047openalex-snapshot
A trace based extension of linear time temporal logic
inferredcites →https://doi.org/10.1109/lics.1995.523247openalex-snapshot
Model-checking of causality properties
inferredcites →https://doi.org/10.1109/lics.1996.561311openalex-snapshot
Locally linear time temporal logic
inferredcites →https://doi.org/10.1145/3828.3837openalex-snapshot
The complexity of propositional linear temporal logics
inferredcites →https://doi.org/10.7146/brics.v3i62.18563openalex-snapshot
An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2001.2956openalex-snapshot
An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1006/jcss.2001.1817openalex-snapshot
LTL Is Expressively Complete for Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/10722167_22openalex-snapshot
Efficient Detection of Global Properties in Distributed Systems Using Partial-Order Methods
inferred← citeshttps://doi.org/10.1007/11691372_18openalex-snapshot
Efficient Model Checking for LTL with Partial Order Snapshots
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_6openalex-snapshot
Local Normal Forms for Logics over Traces
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_79openalex-snapshot
Complete and Tractable Local Linear Time Temporal Logics over Traces
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_80openalex-snapshot
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_4openalex-snapshot
Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_13openalex-snapshot
Safe Realizability of High-Level Message Sequence Charts*
inferred← citeshttps://doi.org/10.1007/3-540-45711-9_2openalex-snapshot
Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids
inferred← citeshttps://doi.org/10.1007/3-540-46674-6_12openalex-snapshot
An Expressive Extension of TLC
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_14openalex-snapshot
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_8openalex-snapshot
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/978-1-4757-3143-9_5openalex-snapshot
LTrL-Based Model Checking for a Restricted Class of Signal Transition Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-97439-7_12openalex-snapshot
A Note on Runtime Verification of Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-05435-7_15openalex-snapshot
Monitoring Distributed Systems Based on Partial Order Executions with Global States
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_27openalex-snapshot
Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_15openalex-snapshot
Specifying and Verifying Partial Order Properties Using Template MSCs
inferred← citeshttps://doi.org/10.1007/978-3-540-30550-7_28openalex-snapshot
An NP-Complete Fragment of LTL
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_37openalex-snapshot
Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/bfb0055039openalex-snapshot
Deciding global partial-order properties
inferred← citeshttps://doi.org/10.1007/bfb0055785openalex-snapshot
A (non-elementary) modular decision procedure for LTrL
inferred← citeshttps://doi.org/10.1007/s10703-005-4592-0openalex-snapshot
Deciding Global Partial-Order Properties
inferred← citeshttps://doi.org/10.1016/j.apal.2011.12.002openalex-snapshot
Bounded linear-time temporal logic: A proof-theoretic investigation
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.04.013openalex-snapshot
Truly Concurrent Logic via In-Between Specification
inferred← citeshttps://doi.org/10.1016/j.ic.2004.08.001openalex-snapshot
Local temporal logic is expressively complete for cograph dependence alphabets
inferred← citeshttps://doi.org/10.1016/j.ic.2006.07.002openalex-snapshot
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.08.002openalex-snapshot
Realizability of high-level message sequence charts: closing the gaps
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.035openalex-snapshot
From local to global temporal logics over Mazurkiewicz traces
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.04.029openalex-snapshot
Temporal BI: Proof system, semantics and translations
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00005-8openalex-snapshot
Undecidability of partial order logics
inferred← citeshttps://doi.org/10.1016/s0169-023x(02)00136-2openalex-snapshot
Deciding LTL over Mazurkiewicz traces
inferred← citeshttps://doi.org/10.1017/s0960129514000048openalex-snapshot
Embedding theorems for LTL and its variants
inferred← citeshttps://doi.org/10.1109/time.2001.930717openalex-snapshot
Deciding LTL over Mazurkiewicz traces
inferred← citeshttps://doi.org/10.18419/opus-2573openalex-snapshot
Automatic synthesis of distributed transition systems
inferred← citeshttps://doi.org/10.18419/opus-2584openalex-snapshot
Logical fragments for Mazurkiewicz traces : expressive power and algebraic characterizations
inferred← citeshttps://doi.org/10.48550/arxiv.0705.0262openalex-snapshot
The Complexity of Games on Higher Order Pushdown 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.