On the public citation graph

Synthesis rules for Petri nets, and how they lead to new results

https://doi.org/10.1007/bfb0039060
0 signed · 28 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/bfb0019972openalex-snapshot
Top-down synthesis of live and bounded free choice 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

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-45594-9_11openalex-snapshot
Workflow Verification: Finding Control-Flow Errors Using Petri-Net-Based Techniques
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_15openalex-snapshot
An efficient polynomial-time algorithm to decide liveness and boundedness of free-choice 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_54openalex-snapshot
Linear time algorithm to find a minimal deadlock in a strongly connected free-choice net
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_58openalex-snapshot
Regular marked Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-65306-6_18openalex-snapshot
Basic linear algebraic techniques for place/transition nets
inferred← citeshttps://doi.org/10.1007/978-3-030-02146-7_5openalex-snapshot
Incremental Computation of Synthesis Rules for Free-Choice 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-319-93931-5_12openalex-snapshot
Fast Incremental Conformance Analysis for Interactive Process Discovery
inferred← citeshttps://doi.org/10.1007/978-3-322-95382-7_7openalex-snapshot
Die Rangbedingungen
inferred← citeshttps://doi.org/10.1007/978-3-540-27755-2_1openalex-snapshot
Business Process Management Demystified: A Tutorial on Models, Systems and Standards for Workflow Management
inferred← citeshttps://doi.org/10.1007/978-3-662-49674-9_27openalex-snapshot
Diagnostic Information for Control-Flow Analysis of Workflow Graphs (a.k.a. Free-Choice Workflow 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.1016/j.is.2020.101561openalex-snapshot
Scalable alignment of process models and event logs: An approach based on automata and S-components
inferred← citeshttps://doi.org/10.1016/s1567-8326(00)00004-7openalex-snapshot
Inheritance of behavior
inferred← citeshttps://doi.org/10.1023/a:1026504523038openalex-snapshot
A three-level knowledge-based system for the generation of live and safe Petri nets for manufacturing systems
inferred← citeshttps://doi.org/10.1109/cccm.2008.360openalex-snapshot
An Algorithm for Eliminating Duplicate Labels of a Labelled Petri Net
inferred← citeshttps://doi.org/10.1109/cit.2005.110openalex-snapshot
Elimination of duplicate labels in Petri-net-based system specification
inferred← citeshttps://doi.org/10.1109/etfa.1999.815415openalex-snapshot
A knowledge-based tool for the automated synthesis of Petri nets for manufacturing systems
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/isic.1995.525120openalex-snapshot
An O
inferred← citeshttps://doi.org/10.5755/j01.itc.35.2.12042openalex-snapshot
REFINEMENT OF PETRI-NET-BASED SYSTEM SPECIFICATION
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.