Distributing Finite Automata Through Petri Net Synthesis

Abstract. The synthesis problem for Petri nets consists in deciding constructively the existence of a Petri net with sequential state graph isomorphic to a given graph. If events are attached to locations, one may set as an additional requirement that the synthesised net should be distributable; i.e. such that events at different locations have no common input place, whence distributed conflicts are avoided. Distributable nets are easily implemented by finite families of automata (one per location) communicating with each other by asynchronous message passing. We show that the general Petri net synthesis problem and its distributed version may both be solved in time polynomial in the size of the given graph. We report on some preliminary experiments of Petri net synthesis applied to the distribution of reactive automata using the tool SYNET.

[1]  Richard P. Hopkins.  Distributable nets , 1990, Applications and Theory of Petri Nets.

[2]  Alexandre Yakovlev.  Designing Control Logic for Counterflow Pipeline Processor Using Petri Nets , 1998, Formal Methods Syst. Des..

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

[4]  T. B. Boffey,et al.  Applied Graph Theory , 1973 .

[5]  Benoit Caillaud.  Synet : un outil de synthèse de réseaux de Petri bornés, applications , 1997 .

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

[7]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[8]  Manfred Droste,et al.  Petri nets and automata with concurrency relations—an adjunction , 1993 .

[9]  Luciano Lavagno,et al.  Complete state encoding based on the theory of regions , 1996, Proceedings Second International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[10]  Manfred Droste,et al.  From Petri Nets to Automata with Concurrency , 2002, Appl. Categorical Struct..

[11]  Éric Badouel,et al.  On the Synthesis of General Petri Nets , 1996 .

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

[13]  Luciano Lavagno,et al.  Deriving Petri Nets for Finite Transition Systems , 1998, IEEE Trans. Computers.

[14]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

[15]  B. Caillaud.  Bounded Petri-net synthesis techniques and their applications to the distribution of reactive automata , 1999 .

[16]  Philippe Darondeau,et al.  The Synthesis Problem for Elementary Net Systems is NP-Complete , 1997, Theor. Comput. Sci..

[17]  Jan Tretmans,et al.  Test Generation with Inputs, Outputs and Repetitive Quiescence , 1996, Softw. Concepts Tools.

[18]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[19]  Walter Vogler,et al.  Concurrent Implementation of Asynchronous Transition Systems , 1999, ICATPN.

[20]  Michel Minoux,et al.  Graphes et algorithmes , 1995 .

[21]  Luciano Lavagno,et al.  Synthesizing Petri nets from state-based models , 1995, ICCAD.

[22]  Nidhal Rezg,et al.  Supervisory Control in Discrete Event Systems Using the Theory of Regions , 2000 .