Specification of Asynchronous Component Systems with Modal I/O-Petri Nets

Modal transition systems are an elegant way to formalise the design process of a system through refinement and composition. Here we propose to adapt this methodology to asynchronous composition via Petri nets. The Petri nets that we consider have distinguished labels for inputs, outputs, internal communications and silent actions and "must" and "may" modalities for transitions. The input/output labels show the interaction capabilities of a net to the outside used to build larger nets by asynchronous composition via communication channels. The modalities express constraints for Petri net refinement taking into account observational abstraction from silent transitions. Modal I/O-Petri nets are equipped with a modal transition system semantics. We show that refinement is preserved by asynchronous composition and by hiding of communication channels. We study compatibility properties which express communication requirements for composed systems and we show that these properties are decidable, they are preserved in larger contexts and also by modal refinement. On this basis we propose a methodology for the specification of distributed systems in terms of modal I/O-Petri nets which supports incremental design, encapsulation of components, stepwise refinement and independent implementability.

[1]  Wolfgang Reisig Simple Composition of Nets , 2009, Petri Nets.

[2]  Pierre Ganty,et al.  From Many Places to Few: Automatic Abstraction Refinement for Petri Nets , 2008, Fundam. Informaticae.

[3]  Maciej Koutny,et al.  Petri Net Algebra , 2001, Monographs in Theoretical Computer Science An EATCS Series.

[4]  Karsten Wolf,et al.  Deciding service composition and substitutability using extended operating guidelines , 2009, Data Knowl. Eng..

[5]  Walter Vogler,et al.  Component refinement and CSC-solving for STG decomposition , 2007, Theor. Comput. Sci..

[6]  Paolo Ciancarini,et al.  Architecting families of software systems with process algebras , 2002, TSEM.

[7]  Rolf Hennicker,et al.  Channel Properties of Asynchronously Composed Petri Nets , 2013, Petri Nets.

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

[9]  Petr Jancar Undecidability of Bisimilarity for Petri Nets and Some Related Problems , 1995, Theor. Comput. Sci..

[10]  Philippe Schnoebelen,et al.  Systems and Software Verification, Model-Checking Techniques and Tools , 2001 .

[11]  Susanna Donatelli,et al.  Transactions on Petri Nets and Other Models of Concurrency V , 2012, Lecture Notes in Computer Science.

[12]  Alexander Knapp,et al.  Modal Interface Theories for Communication-Safe Component Assemblies , 2011, ICTAC.

[13]  Niels Lohmann,et al.  Operating Guidelines for Finite-State Services , 2007, ICATPN.

[14]  Kim G. Larsen,et al.  The Use of Static Constructs in A Modal Process Logic , 1989, Logic at Botik.

[15]  Jean-Baptiste Raclet,et al.  Residual for Component Specifications , 2008, Electron. Notes Theor. Comput. Sci..

[16]  Younes Souissi,et al.  On liveness preservation by composition of nets via a set of places , 1990, Applications and Theory of Petri Nets.

[17]  Kim G. Larsen,et al.  A modal process logic , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[18]  Thomas A. Henzinger,et al.  INTERFACE-BASED DESIGN , 2005 .

[19]  Rolf Hennicker,et al.  Refinement and Asynchronous Composition of Modal Petri Nets , 2012, Trans. Petri Nets Other Model. Concurr..

[20]  Gérard Memmi,et al.  Composition of nets via a communication medium , 1991, Applications and Theory of Petri Nets.

[21]  Philippe Schnoebelen,et al.  Systems and Software Verification , 2001, Springer Berlin Heidelberg.

[22]  Jan Kretínský,et al.  Modal Process Rewrite Systems , 2012, ICTAC.