Abstract
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.
This work has been partially sponsored by the EU project ASCENS, 257414.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
\(\mathrm {val} (q)[a\mathrm {++}]\) (\(\mathrm {val} (q)[a\mathrm {--}]\) resp.) denotes the update of \(\mathrm {val} \) which increments (decrements) the value of \(a\) and leaves the values of all other channels unchanged.
- 2.
i.e. there is a transition in \(\rho \) labelled by \({}^{\rhd }{a}\).
References
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)
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)
Bernardo, M., Ciancarini, P., Donatiello, L.: Architecting families of software systems with process algebras. ACM Trans. Softw. Eng. Meth. 11(4), 386–426 (2002)
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)
Best, E., Devillers, R., Koutny, M.: Petri Net Algebra. Springer Monographs in Theoretical Computer Science (2001)
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)
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)
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)
Haddad, S., Hennicker, R., Møller, M.H.: Channel properties of asynchronously composed Petri Nets. In: Colom, J.-M., Desel, J. (eds.) Petri Nets 2013. LNCS, vol. 7927, pp. 369–388. Springer, Heidelberg (2013)
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)
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)
Hennicker, R., Knapp, A.: Modal interface theories for communication-safe component assemblies. In: Cerone, A., Pihlajasaari, P. (eds.) ICTAC 2011. LNCS, vol. 6916, pp. 135–153. Springer, Heidelberg (2011)
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)
Jancar, P.: Undecidability of bisimilarity for Petri Nets and related problems. Theor. Comput. Sci. 148, 281–301 (1995)
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)
Lohmann, N., Massuthe, P., Wolf, K.: Operating guidelines for finite-state services. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 321–341. Springer, Heidelberg (2007)
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)
Reisig, W.: Simple composition of nets. In: Franceschinis, G., Wolf, K. (eds.) Petri Nets 2009. LNCS, vol. 5606, pp. 23–42. Springer, Heidelberg (2009)
Schäfer, M., Vogler, W.: Component refinement and CSC-solving for STG decomposition. Theor. Comput. Sci. 388(1–3), 243–266 (2007)
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)
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)
Stahl, C., Wolf, K.: Deciding service composition and substitutability using extended operating guidelines. Data Knowl. Eng. 68(9), 819–833 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Haddad, S., Hennicker, R., Møller, M.H. (2014). Specification of Asynchronous Component Systems with Modal I/O-Petri Nets. In: Abadi, M., Lluch Lafuente, A. (eds) Trustworthy Global Computing. TGC 2013. Lecture Notes in Computer Science(), vol 8358. Springer, Cham. https://doi.org/10.1007/978-3-319-05119-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-05119-2_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05118-5
Online ISBN: 978-3-319-05119-2
eBook Packages: Computer ScienceComputer Science (R0)