On the public citation graph
Deriving unbounded Petri nets from formal languages
0 signed · 61 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-59293-8_207openalex-snapshot
Polynomial algorithms for the synthesis of bounded nets
inferredcites →https://doi.org/10.1007/3-540-60218-6_26openalex-snapshot
Checking regular properties of Petri nets
inferredcites →https://doi.org/10.1007/3-540-61604-7_71openalex-snapshot
Constrained properties, semilinear systems, and Petri nets
inferredcites →https://doi.org/10.1007/978-1-4471-3078-9_5openalex-snapshot
On The Synchronic Structure of Transition Systems
inferredcites →https://doi.org/10.1007/978-3-642-59136-5_3openalex-snapshot
Context-Free Languages and Pushdown Automata
inferredcites →https://doi.org/10.1007/s002360050046openalex-snapshot
The synthesis problem of Petri nets
inferredcites →https://doi.org/10.1016/0022-0000(86)90006-1openalex-snapshot
A multiparameter analysis of the boundedness problem for vector addition systems
inferredcites →https://doi.org/10.1016/0096-0551(80)90068-5openalex-snapshot
Introduction to formal language theory
inferredcites →https://doi.org/10.1016/0304-3975(78)90036-1openalex-snapshot
The covering and boundedness problems for vector addition systems
inferredcites →https://doi.org/10.1016/b978-044482816-3/50020-4openalex-snapshot
High-level Message Sequence Charts
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/iccad.1995.480008openalex-snapshot
Synthesizing Petri nets from state-based models
inferredcites →https://doi.org/10.1142/s0129054192000231openalex-snapshot
PETRI NETS AND STEP TRANSITION SYSTEMS
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
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-44988-4_2openalex-snapshot
Region Based Synthesis of P/T-Nets and Its Potential Applications
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_5openalex-snapshot
HMSCs as Partial Specifications...with PNs as Completions
inferred← citeshttps://doi.org/10.1007/3-540-48745-x_18openalex-snapshot
Concurrent Implementation of Asynchronous Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-21571-2_15openalex-snapshot
Finding Complex Process-Structures by Exploiting the Token-Game
inferred← citeshttps://doi.org/10.1007/978-3-031-06653-5_16openalex-snapshot
Discovering Process Models with Long-Term Dependencies While Providing Guarantees and Handling Infrequent Behavior
inferred← citeshttps://doi.org/10.1007/978-3-031-08848-3_3openalex-snapshot
Advanced Process Discovery Techniques
inferred← citeshttps://doi.org/10.1007/978-3-031-44505-7_11openalex-snapshot
Real-World Streaming Process Discovery from Low-Level Event Data
inferred← citeshttps://doi.org/10.1007/978-3-031-94634-9_4openalex-snapshot
Synthesizing Petri Nets from Labelled Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-07734-5_5openalex-snapshot
Process Model Discovery: A Method Based on Transition System Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_22openalex-snapshot
MSO Logic and the Partial Order Semantics of Place/Transition-Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-39086-4_6openalex-snapshot
Petri Net Synthesis for Restricted Classes of Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-77313-1_23openalex-snapshot
Over-Approximative Petri Net Synthesis for Restricted Subclasses of Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-27755-2_11openalex-snapshot
Unbounded Petri Net Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-540-68746-7_24openalex-snapshot
Process Discovery Using Integer Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-75183-0_27openalex-snapshot
Process Mining Based on Regions of Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-00899-3_13openalex-snapshot
Process Mining: Overview and Outlook of Petri Net Discovery Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-02424-5_12openalex-snapshot
Hasse Diagram Generators and Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-04856-2_9openalex-snapshot
Comparison of Different Algorithms to Synthesize a Petri Net from a Partial Language
inferred← citeshttps://doi.org/10.1007/978-3-642-18222-8_7openalex-snapshot
On-the-Fly Auditing of Business Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-29072-5_10openalex-snapshot
Incremental Process Discovery
inferred← citeshttps://doi.org/10.1007/978-3-642-38143-0_10openalex-snapshot
Discovering Petri Nets from Event Logs
inferred← citeshttps://doi.org/10.1007/978-3-662-60651-3_1openalex-snapshot
A Tour in Process Mining: From Practice to Algorithmic Challenges
inferred← citeshttps://doi.org/10.1007/s00607-017-0582-5openalex-snapshot
Discovering workflow nets using integer linear programming
inferred← citeshttps://doi.org/10.1016/b978-0-12-800887-4.00011-0openalex-snapshot
Performances evaluation and Petri nets
inferred← citeshttps://doi.org/10.1016/j.ic.2004.04.004openalex-snapshot
The synthesis of Petri nets from path-automatic specifications
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.04.016openalex-snapshot
Regions of Petri nets with a/sync connections
inferred← citeshttps://doi.org/10.1017/9781316755921.013openalex-snapshot
A description of the non-sequential execution of Petri nets in partially commutative linear logic
inferred← citeshttps://doi.org/10.1017/s0960129509990132openalex-snapshot
Process discovery and Petri nets
inferred← citeshttps://doi.org/10.1051/ita:2003006openalex-snapshot
On the Analysis of Petri Nets and their Synthesis from Process Languages
inferred← citeshttps://doi.org/10.1109/acsd.2007.34openalex-snapshot
Synthesis of Petri Nets from Finite Partial Languages
inferred← citeshttps://doi.org/10.1109/acsd.2008.4574609openalex-snapshot
Synthesis of Petri nets from infinite partial languages
inferred← citeshttps://doi.org/10.1109/acsd.2011.16openalex-snapshot
Building Tight Occurrence Nets from Reveals Relations
inferred← citeshttps://doi.org/10.1109/wodes69290.2026.11598519openalex-snapshot
Active identification of safe Petri nets with interleaving and maximal step semantics
inferred← citeshttps://doi.org/10.1109/wsc.2007.4419657openalex-snapshot
How to synthesize nets from languages - a survey
inferred← citeshttps://doi.org/10.3166/jesa.39.287-301openalex-snapshot
Spécifications modales de réseaux de Petri
inferred← citeshttps://doi.org/10.3233/fi-2009-0090openalex-snapshot
Analysis and Synthesis of Net Structures and Transition Graphs
inferred← citeshttps://doi.org/10.3233/fi-2009-147openalex-snapshot
Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages
inferred← citeshttps://doi.org/10.3233/fi-2013-809openalex-snapshot
Building Occurrence Nets from Reveals Relations
inferred← citeshttps://doi.org/10.3233/fi-2017-1548openalex-snapshot
Incremental Process Discovery using Petri Net Synthesis
inferred← citeshttps://doi.org/10.48550/arxiv.1009.5341openalex-snapshot
Canonizable Partial Order Generators and Regular Slice Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1402.2698openalex-snapshot
Automated Verification, Synthesis and Correction of Concurrent Systems via MSO Logic
inferred← citeshttps://doi.org/10.7561/sacs.2017.2.177openalex-snapshot
Adding A/Sync Places to the Synthesis Procedure for Whole-Place Operations Nets with Localities
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.