On the public citation graph

Partial order behaviour and structure of Petri nets

https://doi.org/10.1007/bf01888220
0 signed · 58 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-10001-6_24openalex-snapshot
Linear algebra in net theory
inferredcites →https://doi.org/10.1007/978-3-642-68353-4_46openalex-snapshot
Weighted Synchronic Distances
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/978-3-642-73483-0openalex-snapshot
Nonsequential Processes
inferredcites →https://doi.org/10.1007/978-3-642-73483-0_3openalex-snapshot
Petri Nets
inferredcites →https://doi.org/10.1007/bf01379149openalex-snapshot
Modeling concurrency with partial orders
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/s0019-9958(83)80040-0openalex-snapshot
The non-sequential behaviour of Petri nets
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.1006/inco.1994.1080openalex-snapshot
Reduction and Synthesis of Live and Bounded Free Choice Petri Nets
inferred← citeshttps://doi.org/10.1006/jcss.1995.1070openalex-snapshot
Shortest Paths in Reachability Graphs
inferred← citeshttps://doi.org/10.1007/3-540-52494-0_43openalex-snapshot
Design methods based on nets
inferred← citeshttps://doi.org/10.1007/3-540-53863-1_25openalex-snapshot
Vicinity respecting net morphisms
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_166openalex-snapshot
Esprit basic research action 3148 DEMON (Design methods based on nets) — Aims, scope and achievements —
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-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_49openalex-snapshot
Shortest paths in reachability graphs
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_58openalex-snapshot
Regular marked Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_67openalex-snapshot
Efficient timing analysis of a class of Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-65306-6_15openalex-snapshot
Place/transition Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-69108-1_16openalex-snapshot
Petri Net Based Certification of Event-Driven Process Chains
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-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-031-56222-8_6openalex-snapshot
Coverability in Well-Formed Free-Choice Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-31847-7_22openalex-snapshot
Loose Semantics of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-94-009-0705-8_64openalex-snapshot
Structure and Behaviour of Concurrent Systems: Selected Results of the Esprit Basic Research Action No. 3148: DEMON (Design Methods Based on Nets)
inferred← citeshttps://doi.org/10.1007/bf01211475openalex-snapshot
Compositional generation of home states in free choice nets
inferred← citeshttps://doi.org/10.1007/bfb0020814openalex-snapshot
Reachability in reversible Free Choice systems
inferred← citeshttps://doi.org/10.1007/bfb0020815openalex-snapshot
Compositional generation of home states in 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/s00165-014-0329-4openalex-snapshot
Untanglings: a novel approach to analyzing concurrent systems
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(92)90299-uopenalex-snapshot
A polynomial-time algorithm to decide liveness of bounded free choice nets
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/j.accinf.2025.100725openalex-snapshot
Segregation of duties in accounting systems: A framework
inferred← citeshttps://doi.org/10.1016/s1389-1286(03)00228-7openalex-snapshot
Analysis and simulation of Web services
inferred← citeshttps://doi.org/10.1023/a:1008655714875openalex-snapshot
Bounded Delay Timing Analysis of a Class of CSP Programs
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/async.2012.27openalex-snapshot
Performance Bounds of Asynchronous Circuits with Mode-Based Conditional Behavior
inferred← citeshttps://doi.org/10.1109/async.2013.30openalex-snapshot
Deriving Performance Bounds for Conditional Asynchronous Circuits Using Linear Programing
inferred← citeshttps://doi.org/10.1109/etfa.1995.496810openalex-snapshot
A simulation method of Petri nets by conflict-free ones
inferred← citeshttps://doi.org/10.1109/icsmc.1998.725413openalex-snapshot
New rank theorems for Petri nets and their application to workflow management
inferred← citeshttps://doi.org/10.1109/icsmc.2003.1243879openalex-snapshot
Distributed petri net for knowledge base grid reasoning
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/skg.2005.143openalex-snapshot
Web Service Composition and Analysis: A Petri-net Based Approach
inferred← citeshttps://doi.org/10.1109/wkdd.2008.20openalex-snapshot
Process Knowledge Verification Method Based on Petri Net
inferred← citeshttps://doi.org/10.1111/abac.12190openalex-snapshot
Formal Analysis of Segregation of Duties ( SoD ) in Accounting: A Computational Approach
inferred← citeshttps://doi.org/10.1145/511446.511457openalex-snapshot
Simulation, verification and automated composition of web services
inferred← citeshttps://doi.org/10.1145/511455.511457openalex-snapshot
Simulation, verification and automated composition of web services
inferred← citeshttps://doi.org/10.1155/s0161171204403378openalex-snapshot
Lower and upper bounds of shortest paths in reachability graphs
inferred← citeshttps://doi.org/10.3233/fi-2010-228openalex-snapshot
Free-Choice Petri Nets without Frozen Tokens, and Bipolar Synchronization Systems
inferred← citeshttps://doi.org/10.3390/s21248433openalex-snapshot
Extended Hierarchical Fuzzy Interpreted Petri Net
inferred← citeshttps://doi.org/10.5555/1363217.1363279openalex-snapshot
Process knowledge verification method based on petri net
inferred← citeshttps://doi.org/10.70675/7718b185z540cz42e9zb19bzd4a7923e31e0openalex-snapshot
Dynamics of a two-level system with priorities and application to an emergency call center
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.