Synthesizing Petri nets from state-based models

This paper presents a method to synthesize labeled Petri nets from state-based models. Although state-based models (such as Finite State Machines) are a powerful formalism to describe the behavior of sequential systems, they cannot explicitly express the notions of concurrency, causality and conflict. Petri nets can naturally capture these notions. The proposed method in based on deriving an Elementary Transition System (ETS) from a specification model. 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 ETS. This paper presents the first known approach to obtain an ETS from a non-elementary TS and derive a place-irredundant Petri net. Furthermore, by imposing constraints on the synthesis method, different classes of Petri nets can be derived from the same reachability graph (pure, free choice, unique choice). This method has been implemented and efficiently applied in different frameworks: Petri net composition, synthesis of Petri nets from asynchronous circuits, and resynthesis of Petri nets.

[1]  C. Petri.  Kommunikation mit Automaten , 1962 .

[2]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[3]  Robert M. Keller,et al.  A Fundamental Tehoerem of Asynchronous Parallel Computation , 1974, Sagamore Computer Conference.

[4]  M. Malik,et al.  Operating Systems , 1992, Lecture Notes in Computer Science.

[5]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[6]  Alexandre Yakovlev,et al.  Signal Graphs: From Self-Timed to Timed Ones , 1985, PNPM.

[7]  Tam-Anh Chu,et al.  Synthesis of self-timed VLSI circuits from graph-theoretic specifications , 1987 .

[8]  Frank Thomson Leighton,et al.  Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits , 1988 .

[9]  Robert P. Kurshan,et al.  Analysis of Discrete Event Coordination , 1989, REX Workshop.

[10]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[11]  V. Rich.  Personal communication , 1989, Nature.

[12]  Ivan E. Sutherland,et al.  Micropipelines , 1989, Commun. ACM.

[13]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[14]  R. Alur,et al.  Automata For Modeling Real-Time Systems , 1990, ICALP.

[15]  G. Rozenberg,et al.  Elementary transition systems , 1990 .

[16]  Bill Lin,et al.  Minimization of symbolic relations , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[17]  David L. Dill,et al.  Automatic synthesis of locally-clocked asynchronous state machines , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[18]  Edmund M. Clarke,et al.  A language for compositional specification and verification of finite state hardware controllers , 1991 .

[19]  Cornelis Hermanus Vanberkel,et al.  Handshake circuits: An intermediary between communicating processes and VLSI , 1992 .

[20]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[21]  Madhavan Mukund.  Petri Nets and Step Transition Systems , 1992, Int. J. Found. Comput. Sci..

[22]  Michael Kishinevsky,et al.  Concurrent hardware : the theory and practice of self-timed design , 1993 .

[23]  Jordi Cortadella,et al.  Polynomial algorithms for the synthesis for hazard-free circuits from signal transition graphs , 1993, ICCAD.

[24]  Luciano Lavagno,et al.  Algorithms for Synthesis and Testing of Asynchronous Circuits , 1993 .

[25]  M. Nielsen,et al.  Decidability Issues for Petri Nets , 1994 .

[26]  Ivan E. Sutherland,et al.  Counter ow Pipeline Processor Architecture , 1994 .

[27]  Ivan E. Sutherland,et al.  The counterflow pipeline processor architecture , 1994, IEEE Design & Test of Computers.

[28]  Steven M. Burns,et al.  Bounded delay timing analysis of a class of CSP programs with choice , 1994, Proceedings of 1994 IEEE Symposium on Advanced Research in Asynchronous Circuits and Systems.

[29]  Tomas Rokicki.  Representing and modeling digital circuits , 1994 .

[30]  Luciano Lavagno,et al.  Designing asynchronous circuits from behavioural specifications with internal conflicts , 1994, Proceedings of 1994 IEEE Symposium on Advanced Research in Asynchronous Circuits and Systems.

[31]  Jordi Cortadella,et al.  Petri Net Analysis Using Boolean Manipulation , 1994, Application and Theory of Petri Nets.

[32]  Luciano Lavagno,et al.  Synthesizing Petri nets from state-based models , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[33]  Philippe Darondeau,et al.  Polynomial Algorithms for the Synthesis of Bounded Nets , 1995, TAPSOFT.

[34]  Giorgio De Michelis,et al.  On The Synchronic Structure of Transition Systems , 1995, STRICT.

[35]  M. Yoeli,et al.  Net-based Modeling of Communicating Parallel Processes with Applications to Vlsi Design Net-based Modeling of Communicating Parallel Processes with Applicanons to Vlsi Design , 2022 .