×

Specification of asynchronous component systems with modal I/O-Petri nets. (English) Zbl 1348.68162

Abadi, Martín (ed.) et al., Trustworthy global computing. 8th international symposium, TGC 2013, Buenos Aires, Argentina, August 30–31, 2013. Revised selected papers. Cham: Springer (ISBN 978-3-319-05118-5/pbk; 978-3-319-05119-2/ebook). Lecture Notes in Computer Science 8358, 219-234 (2014).
Summary: 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.
For the entire collection see [Zbl 1334.68011].

MSC:

68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q60 Specification and verification (program logics, model checking, etc.)

Software:

BPEL2oWFN
Full Text: DOI

References:

[1] de Alfaro, L., Henzinger, T.A.: Interface-based design. Engineering Theories of Software-intensive Systems, NATO Science Series: Mathematics, Physics, and Chemistry, vol. 195. Springer, pp. 83-104 (2005)
[2] Beneš, N., Křetínský, J.: Modal process rewrite systems. In: Proceedings of the International Conference on Theoretical Aspects of Computing (ICTAC 2012), vol. LNCS 7521, pp 120-135, Springer (2012) · Zbl 1362.68199
[3] Bernardo, M.; Ciancarini, P.; Donatiello, L., Architecting families of software systems with process algebras, ACM Trans. Softw. Eng. Meth., 11, 4, 386-426, 2002 · doi:10.1145/606612.606614
[4] Bérard, B., Bidoit, M., Finkel, A., Laroussinie, F., Petit, A., Petrucci, L., Schnoebelen, P.: Systems and Software Verification: Model-Cheking Techniques and Tools. Springer, Heidelberg (2001) · Zbl 1002.68029
[5] Best, E., Devillers, R., Koutny, M.: Petri Net Algebra. Springer Monographs in Theoretical Computer Science (2001)
[6] Brauer, W., Gold, R., Vogler, W.: A survey of behaviour and equivalence preserving refinements of Petri nets. Applications and Theory of Petri Nets, pp. 1-46 (1989)
[7] Elhog-Benzina, D., Haddad, S., Hennicker, R.: Refinement and asynchronous composition of modal Petri Nets. In: Jensen, K., Donatelli, S., Kleijn, J. (eds.) Transactions on Petri Nets and Other Models of Concurrency V. LNCS, vol. 6900, pp. 96-120. Springer, Heidelberg (2012) · Zbl 1350.68201
[8] Ganty, P.; Raskin, J-F; Van Begin, L., From many places to few: automatic abstraction refinement for Petri Nets, ATPN 2007, LNCS, 4546, 124-143, 2007 · Zbl 1226.68054
[9] Haddad, S.; Hennicker, R.; Møller, MH; Colom, J-M; Desel, J., Channel properties of asynchronously composed Petri Nets, Petri Nets 2013, 369-388, 2013, Heidelberg: Springer, Heidelberg · Zbl 1381.68203
[10] Haddad, S., Hennicker, R., Møller, M.H.: Channel properties of asynchronously composed Petri Nets. Research Report LSV-13-05, Laboratoire Spécification et Vérification, ENS Cachan, France (2013)
[11] Haddad, S., Hennicker, R., Møller, M.H.: Specification of asynchronous component systems with modal I/O-Petri Nets. Research Report LSV-13-16, Laboratoire Spécification et Vérification. ENS Cachan, France (2013)
[12] Hennicker, R.; Knapp, A.; Cerone, A.; Pihlajasaari, P., Modal interface theories for communication-safe component assemblies, ICTAC 2011, 135-153, 2011, Heidelberg: Springer, Heidelberg · Zbl 1350.68182
[13] Hüttel, H., Larsen, K.G.: The use of static constructs in a modal process logic. In: Logic at Botik 1989, pp. 163-180 (1989) · Zbl 0683.03014
[14] Jancar, P., Undecidability of bisimilarity for Petri Nets and related problems, Theor. Comput. Sci., 148, 281-301, 1995 · Zbl 0873.68147 · doi:10.1016/0304-3975(95)00037-W
[15] Larsen, K.G., Thomsen, B.; A modal process logic. In: 3rd Annual Symposium on Logic in Computer Science (LICS), IEEE Computer Society, pp. 203-210 (1988)
[16] Lohmann, N.; Massuthe, P.; Wolf, K.; Kleijn, J.; Yakovlev, A., Operating guidelines for finite-state services, ICATPN 2007, 321-341, 2007, Heidelberg: Springer, Heidelberg · Zbl 1226.68063
[17] Raclet, J.-B.: Residual for component specifications. In: Proceedings of the 4th International Workshop on Formal Aspects of Component Software (FACS07), Sophia-Antipolis, France (2007)
[18] Reisig, W.: Simple composition of nets. In: Franceschinis, G., Wolf, K. (eds.) Petri Nets 2009. LNCS, vol. 5606, pp. 23-42. Springer, Heidelberg (2009) · Zbl 1242.68184
[19] Schäfer, M.; Vogler, W., Component refinement and CSC-solving for STG decomposition, Theor. Comput. Sci., 388, 1-3, 243-266, 2007 · Zbl 1143.68055 · doi:10.1016/j.tcs.2007.08.005
[20] Souissi, Y.: On liveness preservation by composition of nets via a set of places. In: 11th International Conference on Applications and Theory of Petri Nets, LNCS 524, pp. 277-295 (1990)
[21] Souissi, Y., Memmi, G.: Composition of nets via a communication medium. In: 10th International Conference on Applications and Theory of Petri Nets, LNCS 483, pp. 457-470 (1989)
[22] Stahl, C.; Wolf, K., Deciding service composition and substitutability using extended operating guidelines, Data Knowl. Eng., 68, 9, 819-833, 2009
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.