On the public citation graph

Structure theory of Petri nets: the free choice hiatus

https://doi.org/10.1007/bfb0046840
0 signed · 65 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/11494744_21openalex-snapshot
Determinate STG Decomposition of Marked Graphs
inferred← citeshttps://doi.org/10.1007/11603009_16openalex-snapshot
Time Supervision of Concurrent Systems Using Symbolic Unfoldings of Time Petri Nets
inferred← citeshttps://doi.org/10.1007/11767589_8openalex-snapshot
Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-17906-2_33openalex-snapshot
COSY: Its relation to nets and to CSP
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_13openalex-snapshot
Randomized Non-sequential Processes
inferred← citeshttps://doi.org/10.1007/3-540-45594-9_11openalex-snapshot
Workflow Verification: Finding Control-Flow Errors Using Petri-Net-Based Techniques
inferred← citeshttps://doi.org/10.1007/3-540-47961-9_37openalex-snapshot
An Alternative Way to Analyze Workflow Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48068-4_13openalex-snapshot
Characterizing Liveness of Petri Nets in Terms of Siphons
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-53863-1_31openalex-snapshot
Coloured petri nets: A high level language for system design and analysis
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-55610-9_178openalex-snapshot
Structural techniques and performance bounds of stochastic Petri net models
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_180openalex-snapshot
A survey of equivalence notions for net based systems
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-61363-3_20openalex-snapshot
An O(¦S¦ × ¦T¦)-algorithm to verify if a net is regular
inferred← citeshttps://doi.org/10.1007/3-540-63139-9_48openalex-snapshot
Verification of workflow nets
inferred← citeshttps://doi.org/10.1007/978-1-4757-9805-0_36openalex-snapshot
Morphisms to Preserve Sructural Properties of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-76983-3_15openalex-snapshot
Synthesis of Petri Nets with Restricted Place-Environments: Classical and Parameterized
inferred← citeshttps://doi.org/10.1007/978-3-319-13350-8_28openalex-snapshot
A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-91268-4_16openalex-snapshot
Markings in Perpetual Free-Choice Nets Are Fully Characterized by Their Enabled Transitions
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_2openalex-snapshot
On Synchronous and Asynchronous Interaction in Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-40229-6_7openalex-snapshot
Back in Time Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-41641-5_10openalex-snapshot
Improving Documentation by Repairing Event Logs
inferred← citeshttps://doi.org/10.1007/978-3-662-43613-4_15openalex-snapshot
On the Step Branching Time Closure of Free-Choice Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-663-06730-6_9openalex-snapshot
Literatur
inferred← citeshttps://doi.org/10.1007/978-94-011-6955-4_1openalex-snapshot
Introducing Petri nets
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/bfb0019972openalex-snapshot
Top-down synthesis of live and bounded free choice nets
inferred← citeshttps://doi.org/10.1007/s11432-014-5259-5openalex-snapshot
Net-structure-based conditions to decide compatibility and weak compatibility for a class of inter-organizational workflow nets
inferred← citeshttps://doi.org/10.1016/0164-1212(91)90076-iopenalex-snapshot
Prototyping and analysis of non-sequential systems using predicate-event nets
inferred← citeshttps://doi.org/10.1016/0165-6074(93)90116-3openalex-snapshot
Petri Nets applied to the modelling and analysis of computer architecture problems
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90299-uopenalex-snapshot
A polynomial-time algorithm to decide liveness of bounded free choice nets
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.endm.2017.05.002openalex-snapshot
Toward uniform random generation in 1-safe Petri nets
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.06.040openalex-snapshot
Symmetric and Asymmetric Asynchronous Interaction
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.04.012openalex-snapshot
A note on regular Petri nets
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00074-5openalex-snapshot
Liveness, fairness, and recurrence in Petri nets
inferred← citeshttps://doi.org/10.1016/s0164-1212(98)10028-6openalex-snapshot
Comparative study and categorization of high-level petri nets
inferred← citeshttps://doi.org/10.1093/comjnl/bxs126openalex-snapshot
Maximal Structuring of Acyclic Process Models
inferred← citeshttps://doi.org/10.1109/32.214828openalex-snapshot
Generalized stochastic Petri nets: a definition at the net level and its implications
inferred← citeshttps://doi.org/10.1109/3477.650057openalex-snapshot
Two theoretical and practical aspects of knitting technique: invariants and a new class of Petri net
inferred← citeshttps://doi.org/10.1109/9.106153openalex-snapshot
Properties and performance bounds for closed free choice synchronized monoclass queueing networks
inferred← citeshttps://doi.org/10.1109/access.2022.3165185openalex-snapshot
A Finite Prefix for Analyzing Information Flow Among Transitions of a Free-Choice Net
inferred← citeshttps://doi.org/10.1109/apscc.2012.64openalex-snapshot
Business Process Compositions Preserving k-Soundness Property
inferred← citeshttps://doi.org/10.1109/codit.2018.8394909openalex-snapshot
PNeS: Tools for the Design and Analysis Petri Nets
inferred← citeshttps://doi.org/10.1109/etfa.1993.396411openalex-snapshot
Polynomial order decomposition algorithms for free choice systems
inferred← citeshttps://doi.org/10.1109/icmlc.2008.4620651openalex-snapshot
Verification of Petri net models based on transition vectors
inferred← citeshttps://doi.org/10.1109/icnc.2012.79openalex-snapshot
Decidability Analysis of Some Classes of Extended Function 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/icsmc.1997.637370openalex-snapshot
A concurrency characteristic in Petri net unfolding
inferred← citeshttps://doi.org/10.1109/icsmc.1998.725399openalex-snapshot
Extracting siphons containing a specified set of places in a Petri net
inferred← citeshttps://doi.org/10.1109/iscas.2003.1205001openalex-snapshot
Insufficiently marked siphon of Petri nets - extension of token-free siphon
inferred← citeshttps://doi.org/10.1109/pnpm.1991.238788openalex-snapshot
Throughput lower bounds for Markovian Petri nets: transformation techniques
inferred← citeshttps://doi.org/10.1109/tsmc.2019.2894778openalex-snapshot
A Polynomial-Time Algorithm to Obtain State Machine Cover of Live and Safe Petri Nets
inferred← citeshttps://doi.org/10.1109/tsmca.2003.811771openalex-snapshot
Timing constraint workflow nets for workflow analysis
inferred← citeshttps://doi.org/10.1142/s0218126698000043openalex-snapshot
THE APPLICATION OF PETRI NETS TO WORKFLOW MANAGEMENT
inferred← citeshttps://doi.org/10.1145/2810001openalex-snapshot
Petri Net Models and Collaborativeness for Parallel Processes with Resource Sharing and Message Passing
inferred← citeshttps://doi.org/10.1587/essfr.2.4_56openalex-snapshot
Net Theory
inferred← citeshttps://doi.org/10.3166/jesa.39.351-365openalex-snapshot
Diagnostic temporel dans les systèmes répartis à l'aide de dépliages de réseaux de Petri temporels
inferred← citeshttps://doi.org/10.3233/fi-2010-293openalex-snapshot
Time-independent Liveness in Time Petri Nets
inferred← citeshttps://doi.org/10.3923/itj.2008.285.291openalex-snapshot
Analysis of Structure properties of Petri Nets Using Transition Vectors
inferred← citeshttps://doi.org/10.4204/eptcs.324.7openalex-snapshot
On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency
inferred← citeshttps://doi.org/10.48550/arxiv.1911.09133openalex-snapshot
Synthesis of Reduced Asymmetric Choice Petri Nets
inferred← citeshttps://doi.org/10.9746/sicetr1965.30.694openalex-snapshot
On Liveness of Timed Petri Nets with Shared Resources Under the Earliest Firing Rule
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.