On the public citation graph
Free choice systems have home states
0 signed · 57 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.1007/3-540-10001-6_22openalex-snapshot
Elements of general net theory
inferredcites →https://doi.org/10.1007/3-540-15204-0_24openalex-snapshot
In praise of free choice nets
inferredcites →https://doi.org/10.1016/0304-3975(82)90020-2openalex-snapshot
Adequacy properties of path programs
inferredcites →https://doi.org/10.1016/s0019-9958(84)80052-2openalex-snapshot
A fresh look at free choice nets
inferredcites →https://doi.org/10.1109/tcom.1982.1095452openalex-snapshot
Petri Nets Theory for the Correctness of Protocols
inferredcites →https://doi.org/10.1145/360248.360251openalex-snapshot
Formal verification of parallel programs
inferredcites →https://doi.org/10.25405/ncl.34127751openalex-snapshot
Relational Semantics of Concurrent Programs (with some Applications)
inferredcites →https://doi.org/10.7146/dpb.v12i158.7432openalex-snapshot
A Theory for Bipolar Synchronisation Schemes
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-15670-4_11openalex-snapshot
Concurrent behaviour: Sequences, processes and axioms
inferred← citeshttps://doi.org/10.1007/3-540-53863-1_27openalex-snapshot
Circuits, handles, bridges and nets
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-56863-8_49openalex-snapshot
Shortest paths in reachability graphs
inferred← citeshttps://doi.org/10.1007/3-540-56863-8_59openalex-snapshot
Liveness and home states in equal conflict systems
inferred← citeshttps://doi.org/10.1007/3-540-63139-9_38openalex-snapshot
Analysis of Petri nets with a dynamic priority method
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_2openalex-snapshot
Traps, Free Choice and Home States
inferred← citeshttps://doi.org/10.1007/978-1-4471-4276-8_13openalex-snapshot
Structural Methods for the Control of Discrete Event Dynamic Systems – The Case of the Resource Allocation Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-3143-9_13openalex-snapshot
Performance Analysis of Asynchronous Circuits and Systems Using Stochastic Timed Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-51831-8_10openalex-snapshot
PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-40578-0_7openalex-snapshot
Reversible Computation vs. Reversibility in Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-47919-2_8openalex-snapshot
Structure Theory of Petri Nets: the Free Choice Hiatus
inferred← citeshttps://doi.org/10.1007/978-3-642-22600-7_19openalex-snapshot
Kleene Theorems for Product Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-29072-5_8openalex-snapshot
A Petri Net Perspective on the Resource Allocation Problem in Software Engineering
inferred← citeshttps://doi.org/10.1007/978-3-642-38143-0_5openalex-snapshot
Structure Theory of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-69968-9_8openalex-snapshot
Liveness Criteria for Special Classes of Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-71275-3_8openalex-snapshot
Lebendigkeitsuntersuchungen spezieller Netzklassen
inferred← citeshttps://doi.org/10.1007/bf00122081openalex-snapshot
A unified signal transition graph model for asynchronous control circuit synthesis
inferred← citeshttps://doi.org/10.1007/bf03036470openalex-snapshot
On the analysis of Petri nets with static priorities
inferred← citeshttps://doi.org/10.1007/bfb0028798openalex-snapshot
A language theoretic approach to serialization problem in concurrent systems
inferred← citeshttps://doi.org/10.1007/bfb0033542openalex-snapshot
Analysis of autonomous Petri nets with bulk services and arrivals
inferred← citeshttps://doi.org/10.1007/s002360050138openalex-snapshot
Priority conflict-free Petri nets
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90012-3openalex-snapshot
Serialization of concurrent programs
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(95)00124-7openalex-snapshot
Structure theory of equal conflict systems
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.01.011openalex-snapshot
Existence of home states in Petri nets is decidable
inferred← citeshttps://doi.org/10.1016/j.scico.2017.10.008openalex-snapshot
Reversible computation vs. reversibility in Petri nets
inferred← citeshttps://doi.org/10.1109/32.67593openalex-snapshot
Ergodicity and throughput bounds of Petri nets with unique consistent firing count vector
inferred← citeshttps://doi.org/10.1109/async.1999.761526openalex-snapshot
Bounding average time separations of events in stochastic timed Petri nets with choice
inferred← citeshttps://doi.org/10.1109/cdc42340.2020.9303795openalex-snapshot
Analysis of Behavioural Properties of Bounded Petri Nets With a Semi-Structural Approach
inferred← citeshttps://doi.org/10.1109/iccad.1992.279390openalex-snapshot
A unified signal transition graph model for asynchronous control circuit synthesis
inferred← citeshttps://doi.org/10.1109/icsmc.2006.384584openalex-snapshot
Lender processes competing for shared resources: Beyond the S4PR paradigm
inferred← citeshttps://doi.org/10.1109/jsyst.2026.3711127openalex-snapshot
A Home States Analysis Method of $\omega$-Independent Unbounded Petri Nets With Application to Unbounded Systems
inferred← citeshttps://doi.org/10.1109/pnpm.1989.68553openalex-snapshot
Tight polynomial bounds for steady-state performance of marked graphs
inferred← citeshttps://doi.org/10.1109/pnpm.1989.68554openalex-snapshot
Properties and steady-state performance bounds for Petri nets with unique repetitive firing count vector
inferred← citeshttps://doi.org/10.1109/pnpm.2003.1231545openalex-snapshot
On non-ergodic infinite-state stochastic Petri nets
inferred← citeshttps://doi.org/10.1109/synasc.2006.71openalex-snapshot
The Confluence Property for Petri Nets and its Applications
inferred← citeshttps://doi.org/10.1155/s0161171204403378openalex-snapshot
Lower and upper bounds of shortest paths in reachability graphs
inferred← citeshttps://doi.org/10.25549/usctheses-c16-640097openalex-snapshot
Pipeline optimization for asynchronous circuits
inferred← citeshttps://doi.org/10.4108/valuetools.2007.1817openalex-snapshot
Detecting Non-Ergodic Simulation Models of Logistics Networks
inferred← citeshttps://doi.org/10.5555/1345263.1345345openalex-snapshot
Detecting non-ergodic simulation models of logistics networks
inferred← citeshttps://doi.org/10.5555/304032.304069openalex-snapshot
A unified signal transition graph model for asynchronous control circuit synthesis
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.