On the public citation graph

Model checking of persistent Petri nets

https://doi.org/10.1007/bfb0023756
0 signed · 30 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-51285-3_34openalex-snapshot
Towards a theory of simulation for verification of concurrent systems
inferredcites →https://doi.org/10.1007/3-540-53863-1_36openalex-snapshot
Stubborn sets for reduced state space generation
inferredcites →https://doi.org/10.1007/3-540-54430-5_107openalex-snapshot
Efficient verification of determinate processes
inferredcites →https://doi.org/10.1007/978-3-540-47919-2openalex-snapshot
Petri Nets: Central Models and Their Properties
inferredcites →https://doi.org/10.1007/978-3-540-47919-2_16openalex-snapshot
Complexity of Place / Transition Nets
inferredcites →https://doi.org/10.1007/978-3-642-73483-0openalex-snapshot
Nonsequential Processes
inferredcites →https://doi.org/10.1007/bfb0023731openalex-snapshot
Using partial orders to improve automatic verification methods
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.1016/0890-5401(89)90026-6openalex-snapshot
Reasoning about networks with many identical finite state processes
inferredcites →https://doi.org/10.1016/s0022-0000(71)80013-2openalex-snapshot
Marked directed graphs
inferredcites →https://doi.org/10.1109/32.106975openalex-snapshot
Automated analysis of concurrent systems with the constrained expression toolset
inferredcites →https://doi.org/10.1109/5.24143openalex-snapshot
Petri nets: Properties, analysis and applications
inferredcites →https://doi.org/10.1145/10590.10611openalex-snapshot
Reasoning about networks with many identical finite-state processes
inferredcites →https://doi.org/10.1145/322077.322079openalex-snapshot
Properties of Conflict-Free and Persistent Petri Nets
inferredcites →https://doi.org/10.3233/fi-1986-9404openalex-snapshot
Notions of Realizable Non-Sequential Processes

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jcss.1995.1070openalex-snapshot
Shortest Paths in Reachability Graphs
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_167openalex-snapshot
The box calculus: A new causal algebra with multi-label communication
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_93openalex-snapshot
Model checking using net unfoldings
inferred← citeshttps://doi.org/10.1007/3-540-56863-8_49openalex-snapshot
Shortest paths in reachability graphs
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_2openalex-snapshot
CALIBAN - Esprit Basic Research WG 6067
inferred← citeshttps://doi.org/10.1007/978-3-319-45811-3_7openalex-snapshot
Prototyping of Concurrent Control Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-96154-5_13openalex-snapshot
Coffee and Cigarettes
inferred← citeshttps://doi.org/10.1007/978-3-322-95382-7_8openalex-snapshot
Anwendungen von Farkas Lemma
inferred← citeshttps://doi.org/10.1016/0167-6423(94)00019-0openalex-snapshot
Model checking using net unfoldings
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.03.002openalex-snapshot
Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets
inferred← citeshttps://doi.org/10.1016/s0306-4379(00)00013-2openalex-snapshot
A process-oriented and content-based perspective on software components
inferred← citeshttps://doi.org/10.1145/3441655openalex-snapshot
Reasoning about Petri Nets: A Calculus Based on Resolution and Dynamic Logic
inferred← citeshttps://doi.org/10.1155/s0161171204403378openalex-snapshot
Lower and upper bounds of shortest paths in reachability graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1512.01952openalex-snapshot
Hierarchy of persistence with respect to the length of action's disability
inferred← citeshttps://doi.org/10.7146/brics.v1i8.21662openalex-snapshot
Decidability Issues for Petri Nets
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.