On the public citation graph
Partial (set) 2-structures
0 signed · 171 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-17906-2openalex-snapshot
Petri Nets: Applications and Relationships to Other Models of Concurrency
inferredcites →https://doi.org/10.1007/978-3-540-47919-2openalex-snapshot
Petri Nets: Central Models and Their Properties
inferredcites →https://doi.org/10.1007/bfb0027048openalex-snapshot
Petri nets: Basic notions, structure, behaviour
inferredcites →https://doi.org/10.1016/0304-3975(90)90129-6openalex-snapshot
Theory of 2-structures, part I: Clans, basic subclasses, and morphisms
inferredcites →https://doi.org/10.1016/0304-3975(90)90130-aopenalex-snapshot
Theory of 2-structures, part II: Representation through labeled tree families
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.1995.1032openalex-snapshot
A Trace Semantics for Petri Nets
inferred← citeshttps://doi.org/10.1007/11767589_17openalex-snapshot
Towards Synthesis of Petri Nets from Scenarios
inferred← citeshttps://doi.org/10.1007/11817949_12openalex-snapshot
Transition Systems of Elementary Net Systems with Localities
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_31openalex-snapshot
Pomsets for Local Trace Languages
inferred← citeshttps://doi.org/10.1007/3-540-44988-4_1openalex-snapshot
Hardware and Petri Nets Application to Asynchronous Circuit Design
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-45541-8_10openalex-snapshot
Generalized Automata and Their Net Representations
inferred← citeshttps://doi.org/10.1007/3-540-45541-8_14openalex-snapshot
Continuous Petri Nets and Transition Systems
inferred← citeshttps://doi.org/10.1007/3-540-45541-8_8openalex-snapshot
Behavior and Realization Construction for Petri Nets Based on Free Monoid and Power Set Graphs
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_12openalex-snapshot
On Recognizable Stable Trace Languages
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_17openalex-snapshot
Synthesizing Distributed Transition Systems from Global Specifications
inferred← citeshttps://doi.org/10.1007/3-540-48745-x_20openalex-snapshot
Reasoning about Algebraic Generalisation of Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_81openalex-snapshot
Extending temporal logic by explicit concurrency
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-55719-9_107openalex-snapshot
A trace semantics for Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_116openalex-snapshot
CCS, locations and asynchronous transition systems
inferred← citeshttps://doi.org/10.1007/3-540-56689-9_51openalex-snapshot
Constraints and extensions in a Calculus of EN systems
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_32openalex-snapshot
Local event structures and Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_207openalex-snapshot
Polynomial algorithms for the synthesis of bounded nets
inferred← citeshttps://doi.org/10.1007/3-540-60164-3_18openalex-snapshot
Dualities between nets and automata induced by schizophrenic objects
inferred← citeshttps://doi.org/10.1007/3-540-63139-9_44openalex-snapshot
Coupling asynchrony and interrupts: Place Chart Nets
inferred← citeshttps://doi.org/10.1007/3-540-63141-0_11openalex-snapshot
Synthesis of nets with inhibitor arcs
inferred← citeshttps://doi.org/10.1007/3-540-65307-4_49openalex-snapshot
Petri nets and digital hardware design
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_2openalex-snapshot
CALIBAN - Esprit Basic Research WG 6067
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_5openalex-snapshot
On The Synchronic Structure of Transition Systems
inferred← citeshttps://doi.org/10.1007/978-1-4757-6656-1_2openalex-snapshot
From Global Specifications to Distributed Implementations
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-030-76983-3_1openalex-snapshot
Topics in Region Theory and Synthesis Problems
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-15629-8_29openalex-snapshot
Discovering Directly-Follows Complete Petri Nets from Event Data
inferred← citeshttps://doi.org/10.1007/978-3-031-70396-6_9openalex-snapshot
Improving Process Discovery Using Translucent Activity Relationships
inferred← citeshttps://doi.org/10.1007/978-3-031-87345-4_13openalex-snapshot
Improvements to the Region-Based Petri Nets Synthesis Algorithm for Process Mining
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-032-17618-9_29openalex-snapshot
Towards Object-Centric and Translucent Process Mining
inferred← citeshttps://doi.org/10.1007/978-3-032-27879-1_6openalex-snapshot
Persistent Permutability Implies Persistence for Pure Dissymmetric Choice Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-07734-5_6openalex-snapshot
Discovering Block-Structured Process Models from Incomplete Event Logs
inferred← citeshttps://doi.org/10.1007/978-3-319-20028-6_6openalex-snapshot
On Distributed Monitoring and Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-39086-4_5openalex-snapshot
The Power of Prime Cycles
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-40566-7_14openalex-snapshot
Identification of Transition Models of Biological Systems in the Presence of Transition Noise
inferred← citeshttps://doi.org/10.1007/978-3-319-46750-4_7openalex-snapshot
Synthesis of Petri Nets with Whole-Place Operations and Localities
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_16openalex-snapshot
Synchronization Synthesis for Network Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-65000-5_2openalex-snapshot
Synthesizing Petri Nets from Hasse Diagrams
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-319-91268-4_4openalex-snapshot
Petri Net Synthesis with Union/Find
inferred← citeshttps://doi.org/10.1007/978-3-319-91268-4_5openalex-snapshot
Factorisation of Petri Net Solvable Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-96154-5_27openalex-snapshot
From Nets to Circuits and from Circuits to Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-24669-5_39openalex-snapshot
Process Decomposition via Synchronization Events and Its Application to Counter-Process Decomposition
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-27755-2_8openalex-snapshot
A Survey on Non-interference with Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-27793-4_5openalex-snapshot
Formal Tools for Modular System Development
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_25openalex-snapshot
On the Synthesis of Zero-Safe Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-68746-7_10openalex-snapshot
A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-68746-7_11openalex-snapshot
Synthesis of Nets with Step Firing Policies
inferred← citeshttps://doi.org/10.1007/978-3-540-68746-7_25openalex-snapshot
Synthesis of Petri Nets from Scenarios with VipTool
inferred← citeshttps://doi.org/10.1007/978-3-540-73094-1_21openalex-snapshot
Theory of Regions for the Synthesis of Inhibitor Nets from Scenarios
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-540-78942-0_10openalex-snapshot
From Human Knowledge to Process Models
inferred← citeshttps://doi.org/10.1007/978-3-540-85758-7_26openalex-snapshot
A Region-Based Algorithm for Discovering Petri Nets from Event Logs
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_36openalex-snapshot
Partial Order Semantics of Types of Nets
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-02424-5_7openalex-snapshot
Pomset Languages of Finite Step Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-03848-8_22openalex-snapshot
Divide-and-Conquer Strategies for Process Mining
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-13675-7_14openalex-snapshot
Process Mining from a Basis of State Regions
inferred← citeshttps://doi.org/10.1007/978-3-642-15643-4_33openalex-snapshot
Rbminer: A Tool for Discovering Petri Nets from Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-15880-3_18openalex-snapshot
Process Mining Meets Abstract Interpretation
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-31131-4_8openalex-snapshot
On the α-Reconstructibility of Workflow Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-35179-2_1openalex-snapshot
The Label Splitting Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-45730-6_7openalex-snapshot
Tissue Systems and Petri Net Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_2openalex-snapshot
Automated Synthesis of Distributed Controllers
inferred← citeshttps://doi.org/10.1007/978-3-662-58381-4_3openalex-snapshot
On Stability of Regional Orthomodular Posets
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/978-3-662-60651-3_9openalex-snapshot
Relabelling LTS for Petri Net Synthesis via Solving Separation Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-63079-2_3openalex-snapshot
Stability of Regional Orthomodular Posets Under Synchronisation and Refinement
inferred← citeshttps://doi.org/10.1007/978-3-662-68191-6_7openalex-snapshot
Strategies for Minimising the Synthesised ENL-Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-68191-6_8openalex-snapshot
Implementable Strategies for a Two-Player Asynchronous Game on Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-662-73305-9_4openalex-snapshot
From Behaviour to Nets via Regions
inferred← citeshttps://doi.org/10.1007/978-3-662-73305-9_7openalex-snapshot
Analysis and Synthesis of Some Subclasses of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-7908-1840-6_8openalex-snapshot
Rough Set Methods for the Synthesis and Analysis of Concurrent Processes
inferred← citeshttps://doi.org/10.1007/978-3-7908-1883-3_22openalex-snapshot
The Synthesis Problem of Concurrent Systems Specified by Dynamic Information Systems
inferred← citeshttps://doi.org/10.1007/bf01185561openalex-snapshot
Elementary transition systems and refinement
inferred← citeshttps://doi.org/10.1007/bf02983375openalex-snapshot
A characterization of set representable labeled partial 2-structures through decompositions
inferred← citeshttps://doi.org/10.1007/bf03180565openalex-snapshot
An algebraic characterisation of elementary net system (observable) state space
inferred← citeshttps://doi.org/10.1007/bfb0055646openalex-snapshot
Deriving unbounded Petri nets from formal languages
inferred← citeshttps://doi.org/10.1007/bfb0055647openalex-snapshot
Decompositions of asynchronous systems
inferred← citeshttps://doi.org/10.1007/bfb0055648openalex-snapshot
Synthesis of ENI-systems using minimal regions
inferred← citeshttps://doi.org/10.1007/s001650200022openalex-snapshot
Distributing Finite Automata Through Petri Net Synthesis
inferred← citeshttps://doi.org/10.1007/s00170-003-1715-xopenalex-snapshot
Synthesis of feedback control elements for discrete event systems using Petri net models and theory of regions
inferred← citeshttps://doi.org/10.1007/s00170-009-2299-xopenalex-snapshot
Enhancement of an efficient liveness-enforcing supervisor for flexible manufacture systems
inferred← citeshttps://doi.org/10.1007/s00170-012-4460-1openalex-snapshot
Enhancement of an efficient control policy for FMSs using the theory of regions and selective siphon method
inferred← citeshttps://doi.org/10.1007/s00236-012-0170-2openalex-snapshot
Step semantics of boolean nets
inferred← citeshttps://doi.org/10.1007/s00236-014-0209-7openalex-snapshot
Synthesis and reengineering of persistent systems
inferred← citeshttps://doi.org/10.1007/s00236-017-0310-9openalex-snapshot
Bounded choice-free Petri net synthesis: algorithmic issues
inferred← citeshttps://doi.org/10.1007/s002360050046openalex-snapshot
The synthesis problem of Petri nets
inferred← citeshttps://doi.org/10.1007/s00607-017-0582-5openalex-snapshot
Discovering workflow nets using integer linear programming
inferred← citeshttps://doi.org/10.1007/s10270-016-0536-yopenalex-snapshot
Encoding process discovery problems in SMT
inferred← citeshttps://doi.org/10.1007/s10618-011-0226-xopenalex-snapshot
Projection approaches to process mining using region-based techniques
inferred← citeshttps://doi.org/10.1007/s10626-026-00454-9openalex-snapshot
DEDS along their life-cycle: interpreted extensions of Petri nets
inferred← citeshttps://doi.org/10.1007/s10994-018-5709-1openalex-snapshot
Identification of biological transition systems using meta-interpreted logic programs
inferred← citeshttps://doi.org/10.1007/s42979-024-03008-8openalex-snapshot
Analyzing Data Streams from Cyber-Physical-Systems: A Case Study
inferred← citeshttps://doi.org/10.1007/s44311-025-00010-yopenalex-snapshot
Using translucent activity relationships frequencies to enhance process discovery
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90027-2openalex-snapshot
Clans and regions in 2-structures
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90112-0openalex-snapshot
Some complexity results on transition systems and elementary net systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90231-3openalex-snapshot
Primitive 2-structures with the (n − 2)-property
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00120-4openalex-snapshot
An event structure semantics for general Petri nets
inferred← citeshttps://doi.org/10.1016/j.aam.2022.102377openalex-snapshot
Complete edge-colored permutation graphs
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2013.09.001openalex-snapshot
Half a century after Carl Adam Petri’s Ph.D. thesis: A perspective on the field
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.ins.2014.09.057openalex-snapshot
ProDiGen: Mining complete, precise and minimal structure process models with a genetic algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.09.026openalex-snapshot
Transition systems without transitions
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.07.015openalex-snapshot
A quadratic construction for Zielonka automata with acyclic communication structure
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.042openalex-snapshot
Synthesising elementary net systems with localities
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00162-6openalex-snapshot
On the Petri net realization of context-free graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00046-4openalex-snapshot
An algebraic model of observable properties in distributed systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00219-8openalex-snapshot
The synthesis problem for elementary net systems is NP-complete
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80252-xopenalex-snapshot
The essence of Petri nets and transition systems through Abelian groups
inferred← citeshttps://doi.org/10.1109/acsd.2005.7openalex-snapshot
Complexity Results for Checking Distributed Implementability
inferred← citeshttps://doi.org/10.1109/acsd.2007.33openalex-snapshot
Synthesis and Control of Asynchronous and Distributed Systems
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.2009.19openalex-snapshot
Variants of the Language Based Synthesis Problem for Petri Nets
inferred← citeshttps://doi.org/10.1109/csd.2001.981781openalex-snapshot
Synthesis of net systems with inhibitor arcs from step transition systems
inferred← citeshttps://doi.org/10.1109/dsd57027.2022.00031openalex-snapshot
Decomposition of transition systems into sets of synchronizing Free-choice Petri Nets
inferred← citeshttps://doi.org/10.1109/icicis.2010.5534758openalex-snapshot
An improved deadlock prevention strategy for FMSs using theory of regions
inferred← citeshttps://doi.org/10.1109/icma.2010.5589472openalex-snapshot
Petri-net-based supervisory control for FMSs using the theory of regions
inferred← citeshttps://doi.org/10.1109/icsmc.2011.6083771openalex-snapshot
An efficient deadlock prevention policy for FMSs using reduction method and theory of regions
inferred← citeshttps://doi.org/10.1109/synasc.2006.21openalex-snapshot
Characterizing Workflow Nets Using Regions
inferred← citeshttps://doi.org/10.1109/tase.2026.3695285openalex-snapshot
Synthesis of Free-Labeled Petri Nets With Inhibitor Arcs: An Exact and Efficient Approach
inferred← citeshttps://doi.org/10.1109/tsmca.2011.2164241openalex-snapshot
Computationally Improved Optimal Deadlock Control Policy for Flexible Manufacturing Systems
inferred← citeshttps://doi.org/10.1109/wsc.2007.4419657openalex-snapshot
How to synthesize nets from languages - a survey
inferred← citeshttps://doi.org/10.1142/s0218843004000973openalex-snapshot
BRIDGING THE GAP BETWEEN BUSINESS MODELS AND WORKFLOW SPECIFICATIONS
inferred← citeshttps://doi.org/10.2298/csis200131013bopenalex-snapshot
Reverse engineering models of software interfaces
inferred← citeshttps://doi.org/10.25405/ncl.34127382openalex-snapshot
Synthesis of PTL-nets with Partially Localised Conflicts
inferred← citeshttps://doi.org/10.25405/ncl.34165569openalex-snapshot
Classifying Boolean Nets for Region-based Synthesis
inferred← citeshttps://doi.org/10.3233/fi-2009-132openalex-snapshot
Synthesis of Nets with Step Firing Policies
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-2011-413openalex-snapshot
Compact Representations and Efficient Algorithms for Operating Guidelines
inferred← citeshttps://doi.org/10.3233/fi-2011-612openalex-snapshot
Light Region-based Techniques for Process Discovery
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.3233/fi-2017-1550openalex-snapshot
Synthesis of Transition Systems from Quantum Logics
inferred← citeshttps://doi.org/10.3233/fun-2006-73305openalex-snapshot
Event Structures with Disabling/Enabling Relation and Event Automata
inferred← citeshttps://doi.org/10.3390/app122010436openalex-snapshot
Edge Intelligence Service Orchestration with Process Mining
inferred← citeshttps://doi.org/10.34768/amcs-2023-0011openalex-snapshot
Generation of synchronizing state machines from a transition system: A region-based approach
inferred← citeshttps://doi.org/10.4018/978-1-4666-4034-4.ch004openalex-snapshot
A Computationally Improved Control Policy for FMS Using Crucial Marking/Transition-Separation Instances
inferred← citeshttps://doi.org/10.4204/eptcs.100.1openalex-snapshot
Membrane Systems and Petri Net Synthesis
inferred← citeshttps://doi.org/10.4204/eptcs.40openalex-snapshot
Proceedings Fourth Workshop on Membrane Computing and Biologically Inspired Process Calculi 2010
inferred← citeshttps://doi.org/10.5821/dissertation-2117-113683openalex-snapshot
Structure discovery techniques for circuit design and process model visualization
inferred← citeshttps://doi.org/10.6000/2371-1647.2018.04.01openalex-snapshot
Lattices Generated by Information Systems and their Internal Structure
inferred← citeshttps://doi.org/10.70675/c3eebce1z831bz424ezb37bzafd8c00bc9fcopenalex-snapshot
Vérification de réseaux de Pétri avec états sous une sémantique d'ordres partiels
inferred← citeshttps://doi.org/10.7146/dpb.v21i399.6633openalex-snapshot
Transition System Models for Concurrency
inferred← citeshttps://doi.org/10.7561/sacs.2018.2.199openalex-snapshot
Simultaneous Petri Net Synthesis
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.