On the public citation graph

Computing reachability properties hidden in finite net unfoldings

https://doi.org/10.1007/bfb0058040
0 signed · 21 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-11494-7_22openalex-snapshot
Specification and verification of concurrent systems in CESAR
inferredcites →https://doi.org/10.1007/3-540-55610-9_177openalex-snapshot
A survey of basic net models and modular net classes
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-61042-1_40openalex-snapshot
An improvement of McMillan's unfolding algorithm
inferredcites →https://doi.org/10.1007/978-3-642-73483-0_3openalex-snapshot
Petri Nets
inferredcites →https://doi.org/10.1007/bf01463946openalex-snapshot
Branching processes of Petri nets
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(87)90090-9openalex-snapshot
Sequential and concurrent behaviour in Petri net theory
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470611647.ch13openalex-snapshot
Petri Net Unfoldings — Properties
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_10openalex-snapshot
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_40openalex-snapshot
A New Unfolding Approach to LTL Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-48068-4_11openalex-snapshot
Computing a Finite Prefix of a Time Petri Net
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_18openalex-snapshot
A Complete Finite Prefix for Process Algebra
inferred← citeshttps://doi.org/10.1007/3-540-49253-4_37openalex-snapshot
The State of PEP
inferred← citeshttps://doi.org/10.1007/bfb0054167openalex-snapshot
Combining finite automata, parallel programs and SDL using Petri nets
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80250-6openalex-snapshot
Branching Processes of general S/T-Systems and their properties
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80293-2openalex-snapshot
Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding
inferred← citeshttps://doi.org/10.1109/chicc.2006.4347094openalex-snapshot
Reachable relation of markings analysis using net unfolding
inferred← citeshttps://doi.org/10.1109/hicss.1998.649235openalex-snapshot
Towards compositional verification of SDL systems
inferred← citeshttps://doi.org/10.3990/1.9789036515641openalex-snapshot
Towards effective model checking
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.