On the public citation graph

Deciding global partial-order properties

https://doi.org/10.1007/bfb0055039
0 signed · 32 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.1994.1035openalex-snapshot
A Partial Approach to Model Checking
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-17906-2_30openalex-snapshot
Trace theory
inferredcites →https://doi.org/10.1007/3-540-56496-9_14openalex-snapshot
Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits
inferredcites →https://doi.org/10.1007/3-540-58179-0_69openalex-snapshot
Combining partial order reductions with on-the-fly model-checking
inferredcites →https://doi.org/10.1007/978-3-540-69850-0_12openalex-snapshot
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
inferredcites →https://doi.org/10.1007/bf00709154openalex-snapshot
A stubborn attack on state explosion
inferredcites →https://doi.org/10.1007/bf01379149openalex-snapshot
Modeling concurrency with partial orders
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/bfb0055048openalex-snapshot
Difficult configurations — on the complexity of LTrL
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/0167-6423(94)00019-0openalex-snapshot
Model checking using net unfoldings
inferredcites →https://doi.org/10.1016/0304-3975(90)90096-zopenalex-snapshot
Interleaving set temporal logic
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.1997.614946openalex-snapshot
An expressively complete linear time temporal logic for Mazurkiewicz traces
inferredcites →https://doi.org/10.1142/1905openalex-snapshot
Theoretical Computer Science

What points at this work

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

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/978-0-387-35533-7_9openalex-snapshot
Specification and Verification of Message Sequence Charts
inferred← citeshttps://doi.org/10.1007/978-3-030-00262-6_5openalex-snapshot
Formal Methods
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-540-24727-2_15openalex-snapshot
Specifying and Verifying Partial Order Properties Using Template MSCs
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_33openalex-snapshot
Snapshot Verification
inferred← citeshttps://doi.org/10.1007/bfb0055048openalex-snapshot
Difficult configurations — on the complexity of LTrL
inferred← citeshttps://doi.org/10.1007/s10703-005-4593-zopenalex-snapshot
Difficult Configurations?On the Complexity of LTrL
inferred← citeshttps://doi.org/10.1007/s13347-016-0235-1openalex-snapshot
Explaining Engineered Computing Systems’ Behaviour: the Role of Abstraction and Idealization
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.03.002openalex-snapshot
Efficient model checking for LTL with partial order snapshots
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00005-8openalex-snapshot
Undecidability of partial order logics
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.3233/fi-1998-3611openalex-snapshot
Adding Partial Orders to Linear Temporal Logic
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.