On the public citation graph
Top-down synthesis of live and bounded free choice nets
0 signed · 47 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_24openalex-snapshot
Linear algebra in net theory
inferredcites →https://doi.org/10.1007/3-540-53863-1_23openalex-snapshot
Improving the linearly based characterization of P/T nets
inferredcites →https://doi.org/10.1007/3-540-53863-1_27openalex-snapshot
Circuits, handles, bridges and nets
inferredcites →https://doi.org/10.1007/978-3-642-72822-8_8openalex-snapshot
Some Classes of Live and Safe Petri Nets
inferredcites →https://doi.org/10.1007/bfb0039059openalex-snapshot
Reduction and design of well-behaved concurrent systems
inferredcites →https://doi.org/10.1007/bfb0046840openalex-snapshot
Structure theory of Petri nets: the free choice hiatus
inferredcites →https://doi.org/10.1016/0022-0000(79)90050-3openalex-snapshot
Analysis of petri nets by stepwise refinements
inferredcites →https://doi.org/10.1016/0022-0000(83)90029-6openalex-snapshot
A method for stepwise refinement and abstraction of Petri nets
inferredcites →https://doi.org/10.1016/0304-3975(77)90014-7openalex-snapshot
Complexity of some problems in Petri nets
inferredcites →https://doi.org/10.1016/0304-3975(84)90137-3openalex-snapshot
A theory of bipolar synchronization schemes
inferredcites →https://doi.org/10.1016/s0019-9958(84)80052-2openalex-snapshot
A fresh look at free choice nets
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119036821.ch10openalex-snapshot
Model Identification and Synthesis of Discrete‐Event Systems
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-54430-5_88openalex-snapshot
Compositional synthesis of live and bounded free choice Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_177openalex-snapshot
A survey of basic net models and modular net classes
inferred← citeshttps://doi.org/10.1007/3-540-55676-1_14openalex-snapshot
Construction of a class of safe Petri nets by presenting firing sequences
inferred← citeshttps://doi.org/10.1007/3-540-55676-1_8openalex-snapshot
A proof of the Rank Theorem for extended free choice nets
inferred← citeshttps://doi.org/10.1007/3-540-56863-8_37openalex-snapshot
Interleaving functional and performance structural analysis of net models
inferred← citeshttps://doi.org/10.1007/3-540-60029-9_46openalex-snapshot
Handles and reachability analysis of free choice nets
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_57openalex-snapshot
Computing Petri net languages by reductions
inferred← citeshttps://doi.org/10.1007/978-3-031-56222-8_6openalex-snapshot
Coverability in Well-Formed Free-Choice Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-032-27879-1_14openalex-snapshot
Coming Home for Blocking Transitions Fast
inferred← citeshttps://doi.org/10.1007/978-3-319-10398-3_7openalex-snapshot
Attractor Equivalence: An Observational Semantics for Reaction Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-54900-7_52openalex-snapshot
Theoretical Aspects of Petri Nets Decomposition Based on Invariants and Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-662-65303-6_1openalex-snapshot
Property-Preserving Transformations of Elementary Net Systems Based on Morphisms
inferred← citeshttps://doi.org/10.1007/bf01325038openalex-snapshot
Modular synthesis of Petri nets for modeling flexible manufacturing systems
inferred← citeshttps://doi.org/10.1007/bf01325064openalex-snapshot
XPN-FMS: A CAD tool for FMS modeling, analysis, animation, and simulation using Petri nets and X window
inferred← citeshttps://doi.org/10.1007/bf03036471openalex-snapshot
Reduction rules for time Petri nets
inferred← citeshttps://doi.org/10.1007/bfb0020814openalex-snapshot
Reachability in reversible Free Choice systems
inferred← citeshttps://doi.org/10.1007/bfb0039059openalex-snapshot
Reduction and design of well-behaved concurrent systems
inferred← citeshttps://doi.org/10.1007/bfb0039060openalex-snapshot
Synthesis rules for Petri nets, and how they lead to new results
inferred← citeshttps://doi.org/10.1016/j.jss.2005.06.018openalex-snapshot
A petri-net-based synthesis methodology for use-case-driven system design
inferred← citeshttps://doi.org/10.1016/s0140-3664(96)01158-9openalex-snapshot
Petri nets for protocol engineering
inferred← citeshttps://doi.org/10.1109/etfa.1993.396411openalex-snapshot
Polynomial order decomposition algorithms for free choice systems
inferred← citeshttps://doi.org/10.1109/grc.2011.6122702openalex-snapshot
Scalable process modeling based on net synthesis under cloud computing environment
inferred← citeshttps://doi.org/10.1109/hsi.2014.6860481openalex-snapshot
Decomposition, validation and documentation of control process specification in form of a Petri net
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/isads.1993.262696openalex-snapshot
Synchronization mechanism of autonomous decentralized systems modelled by state machine decomposable nets
inferred← citeshttps://doi.org/10.1109/iscas.1992.230536openalex-snapshot
A basic theorem for modular synthesis of state machine allocatable nets
inferred← citeshttps://doi.org/10.1109/pnpm.1999.796557openalex-snapshot
Implicit places in net systems
inferred← citeshttps://doi.org/10.1109/robot.1991.131565openalex-snapshot
Flow equivalent nets for the performance analysis of generalized stochastic Petri nets
inferred← citeshttps://doi.org/10.1109/sicon.1995.526065openalex-snapshot
Reduction rules of Petri nets for verification of the communication protocol
inferred← citeshttps://doi.org/10.3233/fi-2015-1280openalex-snapshot
On Generating Hierarchical Workflow Nets and their Extensions and Verifying Hierarchicality
inferred← citeshttps://doi.org/10.3233/fi-2017-1599openalex-snapshot
On Determining the AND-OR Hierarchy in Workflow 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.