Local State Refinement and Composition of Elementary Net Systems: An Approach Based on Morphisms

In the design of concurrent and distributed systems, modularity and refinement are basic conceptual tools. We propose a notion of refinement/abstraction of local states for a basic class of Petri Nets, associated with a class of morphisms. The morphisms, from a refined system to an abstract one, associate suitable subnets to abstract local states. We define an operation of composition ruled by morphisms of that class. The main results concern behavioural properties preserved and reflected by the morphisms. In particular, we focus on the conditions under which reachable markings are preserved or reflected, and the conditions under which a morphism induces a weak bisimulation between net systems.

[1]  Jörg Desel,et al.  Vicinity Respecting Homomorphisms for Abstracting System Requirements , 2010, Trans. Petri Nets Other Model. Concurr..

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

[3]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[4]  Hartmut Ehrig,et al.  Unifying Petri Nets , 2001, Lecture Notes in Computer Science.

[5]  Eric Fabre,et al.  On the Construction of Pullbacks for Safe Petri Nets , 2006, ICATPN.

[6]  Luca Bernardinello,et al.  Local state refinement on Elementary Net Systems: an approach based on morphisms , 2012, PNSE.

[7]  Carla Simone,et al.  A survey of equivalence notions for net based systems , 1992, Advances in Petri Nets: The DEMON Project.

[8]  Grzegorz Rozenberg,et al.  Elementary transition systems and refinement , 2005, Acta Informatica.

[9]  Mogens Nielsen,et al.  Application and Theory of Petri Nets 2000: 21st International Conference, ICATPN 2000 Aarhus, Denmark, June 26–30, 2000 Proceedings , 2000, ICATPN.

[10]  José Meseguer,et al.  Petri Nets Are Monoids , 1990, Inf. Comput..

[11]  P. S. Thiagarajan,et al.  Petri Nets and Other Models of Concurrency - ICATPN 2006, 27th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, Turku, Finland, June 26-30, 2006, Proceedings , 2006, ICATPN.

[12]  Luca Bernardinello,et al.  Formal Tools for Modular System Development , 2004, ICATPN.

[13]  Wilfried Brauer,et al.  A survey of behaviour and equivalence preserving refinements of Petri nets , 1991, Applications and Theory of Petri Nets.

[14]  Mangioni.  Modularity for system modelling and analysis , 2013 .

[15]  Charles Lakos,et al.  Composing Abstractions of Coloured Petri Nets , 2000, ICATPN.

[16]  Grzegorz Rozenberg,et al.  Elementary Transition Systems , 1990, Theor. Comput. Sci..

[17]  Milan Urbásek,et al.  Rule-Based Refinement of Petri Nets: A Survey , 2003, Petri Net Technology for Communication-Based Systems.

[18]  Grzegorz Rozenberg.  Advances in Petri Nets 1992 , 1992, Lecture Notes in Computer Science.

[19]  Luca Bernardinello,et al.  On Preserving Structural and Behavioural Properties by Composing Net Systems on Interfaces , 2007, Fundam. Informaticae.

[20]  Paul Grefen,et al.  A Three-Level Process Framework for Contract-Based Dynamic Service Outsourcing , 2003 .

[21]  Wolfgang Reisig,et al.  Applications and Theory of Petri Nets 2004 , 2004, Lecture Notes in Computer Science.

[22]  Walter Vogler,et al.  Executions: A New Partial-Order Semantics of Petri Nets , 1991, Theor. Comput. Sci..

[23]  Wil M. P. van der Aalst,et al.  Applications and Theory of Petri Nets 2003 , 2003, Lecture Notes in Computer Science.

[24]  Benoît Caillaud,et al.  Modular System Development with Pullbacks , 2003, ICATPN.

[25]  Marek A. Bednarczyk,et al.  On Concurrent Realization of Reactive Systems and Their Morphisms , 2001, Unifying Petri Nets.

[26]  Glynn Winskel,et al.  Petri Nets, Algebras, Morphisms, and Compositionality , 1987, Inf. Comput..

[27]  Joost Engelfriet,et al.  Elementary Net Systems , 1996, Applications and Theory of Petri Nets.