Petr nets, algebras, morphisms, and compositionality
Information and Computation
Communication and concurrency
Trace theory for automatic hierarchical verification of speed-independent circuits
Trace theory for automatic hierarchical verification of speed-independent circuits
Automata for modeling real-time systems
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Selected papers of the Second Workshop on Concurrency and compositionality
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Handshake circuits: an asynchronous architecture for VLSI programming
Handshake circuits: an asynchronous architecture for VLSI programming
Concurrent hardware: the theory and practice of self-timed design
Concurrent hardware: the theory and practice of self-timed design
Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Representing and modeling digital circuits
Representing and modeling digital circuits
A communicating Petri net model for the design of concurrent asynchronous modules
DAC '94 Proceedings of the 31st annual Design Automation Conference
Free choice Petri nets
Graph models for reachability analysis of concurrent programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
Field-programmable gate arrays: reconfigurable logic for rapid prototyping and implementation of digital systems
The synthesis problem of Petri nets
Acta Informatica
Methodology and tools for state encoding in asynchronous circuit synthesis
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Polynomial algorithms for the synthesis for hazard-free circuits from signal transition graphs
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Communicating sequential processes
Communications of the ACM
Petri nets and speed independent design
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Logic Synthesis and Verification Algorithms
Logic Synthesis and Verification Algorithms
Algorithms for Synthesis and Testing of Asynchronous Circuits
Algorithms for Synthesis and Testing of Asynchronous Circuits
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
Signal Graphs: From Self-Timed to Timed Ones
International Workshop on Timed Petri Nets
Polynomial Algorithms for the Synthesis of Bounded Nets
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
A Fundamental Tehoerem of Asynchronous Parallel Computation
Proceedings of the Sagamore Computer Conference on Parallel Processing
Transformations and Decompositions of Nets
Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part I
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
High Level Synthesis of Synchronous Parallel Controllers
Proceedings of the 17th International Conference on Application and Theory of Petri Nets
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Petri Net Analysis Using Boolean Manipulation
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Analysis of Discrete Event Coordination
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Complete State Encoding Based on the Theory of Regions
ASYNC '96 Proceedings of the 2nd International Symposium on Advanced Research in Asynchronous Circuits and Systems
ASYNC '96 Proceedings of the 2nd International Symposium on Advanced Research in Asynchronous Circuits and Systems
ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS
ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS
Operating systems
Concurrent Implementation of Asynchronous Transition Systems
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
On Concurrent Realization of Reactive Systems and Their Morphisms
Unifying Petri Nets, Advances in Petri Nets
Computers in Industry - Special issue: Process/workflow mining
Real time identification of discrete event systems using Petri nets
Automatica (Journal of IFAC)
Automating Synthesis of Asynchronous Communication Mechanisms
Fundamenta Informaticae - The Fourth Special Issue on Applications of Concurrency to System Design (ACSD05)
A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Process Discovery Using Integer Linear Programming
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Refactoring Process Models in Large Process Repositories
CAiSE '08 Proceedings of the 20th international conference on Advanced Information Systems Engineering
Discovery, Verification and Conformance of Workflows with Cancellation
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Getting rid of OR-joins and multiple start events in business process models
Enterprise Information Systems - Challenges and Solutions in Enterprise Computing - 11th International IEEE EDOC Conference (EDOC 2007)
A Region-Based Algorithm for Discovering Petri Nets from Event Logs
BPM '08 Proceedings of the 6th International Conference on Business Process Management
Assessing State Spaces Using Petri-Net Synthesis and Attribute-Based Visualization
Transactions on Petri Nets and Other Models of Concurrency I
Empirical Studies in Process Model Verification
Transactions on Petri Nets and Other Models of Concurrency II
Process Mining: Overview and Outlook of Petri Net Discovery Algorithms
Transactions on Petri Nets and Other Models of Concurrency II
Analysis and Synthesis of Net Structures and Transition Graphs
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Divide-and-Conquer Strategies for Process Mining
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Process Discovery using Integer Linear Programming
Fundamenta Informaticae - Petri Nets 2008
Moving from Weakly Endochronous Systems to Delay-Insensitive Circuits
Electronic Notes in Theoretical Computer Science (ENTCS)
An efficient liveness enforcing supervisor for FMSs based on Petri nets and the theory of regions
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Process discovery and petri nets†
Mathematical Structures in Computer Science
Expressiveness of Petri Nets with Stopwatches. Discrete-time Part
Fundamenta Informaticae
Improving real-time identification of Petri nets using timing information
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Hardware and Petri nets: application to asynchronous circuit design
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Process mining framework for software processes
ICSP'07 Proceedings of the 2007 international conference on Software process
ProM 4.0: comprehensive support for real process analysis
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Process discovery: capturing the invisible
IEEE Computational Intelligence Magazine
Synthesis of orchestrators from service choreographies
APCCM '09 Proceedings of the Sixth Asia-Pacific Conference on Conceptual Modeling - Volume 96
Process discovery in event logs: An application in the telecom industry
Applied Soft Computing
Modeling process-related RBAC models with extended UML activity models
Information and Software Technology
Survey paper: Refactoring large process model repositories
Computers in Industry
Towards synthesis of petri nets from scenarios
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Projection approaches to process mining using region-based techniques
Data Mining and Knowledge Discovery
Process mining and petri net synthesis
BPM'06 Proceedings of the 2006 international conference on Business Process Management Workshops
Process mining from a basis of state regions
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Process Mining: Overview and Opportunities
ACM Transactions on Management Information Systems (TMIS)
Transactions on Petri Nets and Other Models of Concurrency V
Discovering process models from event multiset
Expert Systems with Applications: An International Journal
Compact Representations and Efficient Algorithms for Operating Guidelines
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
Light Region-based Techniques for Process Discovery
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Analysis and Synthesis of Net Structures and Transition Graphs
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Process Discovery using Integer Linear Programming
Fundamenta Informaticae - Petri Nets 2008
Expressiveness of Petri Nets with Stopwatches. Discrete-time Part
Fundamenta Informaticae
Automating Synthesis of Asynchronous Communication Mechanisms
Fundamenta Informaticae - The Fourth Special Issue on Applications of Concurrency to System Design (ACSD05)
Discovering block-structured process models from event logs - a constructive approach
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Modelling context-aware RBAC models for mobile business processes
International Journal of Wireless and Mobile Computing
Hi-index | 14.99 |
This paper presents a novel method to derive a Petri Net from any specification model that can be mapped into a state-based representation with arcs labeled with symbols from an alphabet of events (a Transition System, TS). The method is based on the theory of regions for Elementary Transition Systems (ETS). Previous work has shown that, for any ETS, there exists a Petri Net with minimum transition count (one transition for each label) with a reachability graph isomorphic to the original Transition System. Our method extends and implements that theory by using the following three mechanisms that provide a framework for synthesis of safe Petri Nets from arbitrary TSs. First, the requirement of isomorphism is relaxed to bisimulation of TSs, thus extending the class of synthesizable TSs to a new class called Excitation-Closed Transition Systems (ECTS). Second, for the first time, we propose a method of PN synthesis for an arbitrary TS based on mapping a TS event into a set of transition labels in a PN. Third, the notion of irredundant region set is exploited, to minimize the number of places in the net without affecting its behavior. The synthesis method can derive different classes of place-irredundant Petri Nets (e.g., pure, free choice, unique choice) from the same TS, depending on the constraints imposed on the synthesis algorithm. This method has been implemented and applied in different frameworks. The results obtained from the experiments have demonstrated the wide applicability of the method.