On the public citation graph
LTL Is Expressively Complete for Mazurkiewicz Traces
0 signed · 44 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.2001.2956openalex-snapshot
An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces
inferredcites →https://doi.org/10.1007/3-540-45022-x_18openalex-snapshot
LTL Is Expressively Complete for Mazurkiewicz Traces
inferredcites →https://doi.org/10.1007/3-540-45653-8_4openalex-snapshot
Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets
inferredcites →https://doi.org/10.1007/3-540-45711-9openalex-snapshot
Formal and Natural Computing: Essays Dedicated to Grzegorz Rozenberg
inferredcites →https://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
inferredcites →https://doi.org/10.1007/3-540-48168-0_14openalex-snapshot
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces
inferredcites →https://doi.org/10.1007/3-540-49116-3_3openalex-snapshot
Classifying Discrete Temporal Properties
inferredcites →https://doi.org/10.1007/3-540-60218-6_33openalex-snapshot
A trace consistent subset of PTL
inferredcites →https://doi.org/10.1007/3-540-60246-1_161openalex-snapshot
A ν-calculus with local views for systems of sequential agents
inferredcites →https://doi.org/10.1007/3-540-61550-4_140openalex-snapshot
Linear time temporal logics over Mazurkiewicz traces
inferredcites →https://doi.org/10.1007/bfb0028588openalex-snapshot
Expressive completeness of LTrL on finite traces: An algebraic proof
inferredcites →https://doi.org/10.1007/bfb0055048openalex-snapshot
Difficult configurations — on the complexity of LTrL
inferredcites →https://doi.org/10.1007/bfb0055785openalex-snapshot
A (non-elementary) modular decision procedure for LTrL
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.1142/s0129054193000043openalex-snapshot
TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11539452_40openalex-snapshot
Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/11813040_37openalex-snapshot
Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check 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-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/978-3-319-46982-9_21openalex-snapshot
Finite-Trace Linear Temporal Logic: Coinductive Completeness
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-45138-9_37openalex-snapshot
Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/978-3-540-73196-2_17openalex-snapshot
Testing Distributed Systems Through Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-73208-2_1openalex-snapshot
On First-Order Fragments for Words and Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_29openalex-snapshot
Realizability of Concurrent Recursive Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-15375-4_34openalex-snapshot
Modal Logic over Higher Dimensional Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-53132-7_13openalex-snapshot
Weighted Automata and Logics on Infinite Graphs
inferred← citeshttps://doi.org/10.1007/s10703-018-0321-3openalex-snapshot
Finite-trace linear temporal logic: coinductive completeness
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.jlamp.2020.100582openalex-snapshot
Specifying reversibility with TLA+
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.2015.07.008openalex-snapshot
A survey on the local divisor technique
inferred← citeshttps://doi.org/10.1109/enabl.2003.1231384openalex-snapshot
A logical model for coordination rule classes in collaborative sessions
inferred← citeshttps://doi.org/10.46298/lmcs-18(2:22)2022openalex-snapshot
Asynchronous wreath product and cascade decompositions for concurrent behaviours
inferred← citeshttps://doi.org/10.48550/arxiv.1410.6026openalex-snapshot
A Survey on the Local Divisor Technique
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.