On the public citation graph

Reachability in reversible Free Choice systems

https://doi.org/10.1007/bfb0020814
0 signed · 31 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/978-1-4471-3860-0_2openalex-snapshot
Traps, Free Choice and Home States
inferredcites →https://doi.org/10.1007/bf00264027openalex-snapshot
Synchronisationsgraphen
inferredcites →https://doi.org/10.1007/bf01888220openalex-snapshot
Partial order behaviour and structure of Petri nets
inferredcites →https://doi.org/10.1007/bfb0019972openalex-snapshot
Top-down synthesis of live and bounded free choice nets
inferredcites →https://doi.org/10.1016/s0022-0000(71)80013-2openalex-snapshot
Marked directed graphs
inferredcites →https://doi.org/10.1137/0213029openalex-snapshot
An Algorithm for the General Petri Net Reachability Problem
inferredcites →https://doi.org/10.1145/800070.802201openalex-snapshot
Decidability of reachability in vector addition systems (Preliminary Version)

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-53863-1_28openalex-snapshot
On the analysis and synthesis of free choice systems
inferred← citeshttps://doi.org/10.1007/3-540-55676-1_17openalex-snapshot
Concurrency relations and the safety problem for Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-56863-8_57openalex-snapshot
A client-server protocol for the composition of Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-56863-8_64openalex-snapshot
A unified approach for reasoning about conflict-free Petri nets
inferred← citeshttps://doi.org/10.1007/978-3-032-17618-9_22openalex-snapshot
On Free Choice and Wil(l): From Petri Net Theory to Process Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-79917-4_19openalex-snapshot
Arrival Theorems for Product-Form Stochastic Petri Nets
inferred← citeshttps://doi.org/10.1007/978-94-011-6955-4_1openalex-snapshot
Introducing Petri nets
inferred← citeshttps://doi.org/10.1007/bf01211475openalex-snapshot
Compositional generation of home states in free choice nets
inferred← citeshttps://doi.org/10.1007/bfb0020815openalex-snapshot
Compositional generation of home states in free choice systems
inferred← citeshttps://doi.org/10.1016/0166-5316(95)00023-2openalex-snapshot
Product form equilibrium distributions and a convolution algorithm for stochastic Petri nets
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90048-kopenalex-snapshot
Traps characterize home states in free choice systems
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90154-lopenalex-snapshot
Reachability in cyclic extended free-choice systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00231-7openalex-snapshot
Complexity results for 1-safe nets
inferred← citeshttps://doi.org/10.1016/s0166-5316(96)00003-xopenalex-snapshot
Mean value analysis of stochastic Petri nets
inferred← citeshttps://doi.org/10.1109/32.541436openalex-snapshot
Approximate mean value analysis for stochastic marked graphs
inferred← citeshttps://doi.org/10.1109/etfa.1993.396411openalex-snapshot
Polynomial order decomposition algorithms for free choice systems
inferred← citeshttps://doi.org/10.1109/icsmc.1993.384812openalex-snapshot
Efficient decomposition algorithms for flexible manufacturing systems modelled by free choice nets
inferred← citeshttps://doi.org/10.1109/pnpm.1991.238797openalex-snapshot
Overview of the results of the Esprit basic research action DEMON-design methods based on nets
inferred← citeshttps://doi.org/10.1109/pnpm.1995.524314openalex-snapshot
Approximate mean value analysis technique for non-product form solution stochastic Petri nets: an application to stochastic marked graphs
inferred← citeshttps://doi.org/10.1109/pnpm.1999.796557openalex-snapshot
Implicit places in net systems
inferred← citeshttps://doi.org/10.1109/tsmca.2011.2157136openalex-snapshot
Process Nets With Channels
inferred← citeshttps://doi.org/10.1145/183018.183028openalex-snapshot
Arrival theorems for product-form stochastic Petri nets
inferred← citeshttps://doi.org/10.3233/fi-1995-2314openalex-snapshot
REACHABILITY IN SOME CLASSES OF ACYCLIC PETRI NETS
inferred← citeshttps://doi.org/10.7146/dpb.v22i455.6773openalex-snapshot
Complexity Results for 1-safe 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.