A Symbolic Algorithm for the Synthesis of Bounded Petri Nets

Authors:
J. Carmona;J. Cortadella;M. Kishinevsky;A. Kondratyev;L. Lavagno;A. Yakovlev
Affiliations:
Universitat Politècnica de Catalunya, Spain;Universitat Politècnica de Catalunya, Spain;Intel Corporation, USA;Cadence Berkeley Laboratories, USA;Politecnico di Torino, Italy;Newcastle University, UK
Venue:
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Year:
2008

Citing 13
Cited 5

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Trace theory

Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Partial (set) 2-structures. Part I: basic notions and the representation problem

Acta Informatica
A trace semantics for Petri nets

Information and Computation
An event structure semantics for general Petri nets

Theoretical Computer Science - Special volume on Petri nets
The synthesis problem of Petri nets

Acta Informatica
Deriving Petri Nets from Finite Transition Systems

IEEE Transactions on Computers
Communication and Concurrency

Communication and Concurrency
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
Theory of Regions

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Synthesis and Control of Asynchronous and Distributed Systems

ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
Process mining based on regions of languages

BPM'07 Proceedings of the 5th international conference on Business process management
Direct Mapping of Low-Latency Asynchronous Controllers From STGs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

A Region-Based Algorithm for Discovering Petri Nets from Event Logs

BPM '08 Proceedings of the 6th International Conference on Business Process Management
Divide-and-Conquer Strategies for Process Mining

BPM '09 Proceedings of the 7th International Conference on Business Process Management
Projection approaches to process mining using region-based techniques

Data Mining and Knowledge Discovery
Incremental process discovery

Transactions on Petri Nets and Other Models of Concurrency V
Building Occurrence Nets from Reveals Relations

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A bounded Petri net is always provided in case it exists. Otherwise, the events are split into several transitions to guarantee the synthesis of a Petri net with bisimilar behavior. The algorithm uses symbolic representations of multisets of states to efficiently generate all the minimal regions. The algorithm has been implemented in a tool. Experimental results show a significant net reduction when compared with approaches for the synthesis of safe Petri nets.