Abstract
Reactive systems (RSs) represent a meta-framework aimed at deriving labelled transition systems from unlabelled ones such that the induced bisimilarity is a congruence. Such a property is desirable, since it allows one to replace a subsystem with an equivalent one without changing the behaviour of the overall system. One of the main drawback of RSs is the restriction to the analysis of ground (i.e., completely specified) systems. Only recently the theory was extended to consider open systems (and rules) and an associated strong bisimulation equivalence. However, the resulting bisimilarity adopted for the formalism turns out to be a congruence only under very restrictive conditions, hindering the applicability of the framework. In this paper we suggest to consider (strong and weak) barbed equivalence as an alternative for open RSs. After proving that it is always a congruence, we instantiate our proposal by addressing the semantics of Asynchronous CCS and of Mobile Ambients.
Research partially supported by the EU FP7-ICT IP ASCEns (IP 257414).
Chapter PDF
Similar content being viewed by others
References
Amadio, R., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous π-calculus. TCS 195(2), 291–324 (1998)
Baldan, P., Bracciali, A., Bruni, R.: A semantic framework for open processes. TCS 389(3), 446–483 (2007)
Bonchi, F., Gadducci, F., Monreale, G.V.: On barbs and labels in reactive systems. In: Klin, B., Sobocinski, P. (eds.) SOS 2009. EPTCS, vol. 18, pp. 46–61 (2009)
Bonchi, F., Gadducci, F., Monreale, G.V.: Reactive systems, barbed semantics, and the mobile ambients. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 272–287. Springer, Heidelberg (2009)
Bonchi, F., Gadducci, F., Monreale, G.V.: Towards a general theory of barbs, contexts and labels. In: Yang, H. (ed.) APLAS 2011. LNCS, vol. 7078, pp. 289–304. Springer, Heidelberg (2011)
Bonchi, F., König, B., Montanari, U.: Saturated semantics for reactive systems. In: LICS 2006, pp. 69–80. IEEE Computer Society (2006)
Bruni, R., de Frutos-Escrig, D., MartÃ-Oliet, N., Montanari, U.: Bisimilarity congruences for open terms and term graphs via tile logic. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 259–274. Springer, Heidelberg (2000)
Bruni, R., Meseguer, J., Montanari, U.: Symmetric monoidal and cartesian double categories as a semantics framework for tile logic. MSCS 12(1), 53–90 (2002)
Cardelli, L., Gordon, A.: Mobile ambients. TCS 240(1), 177–213 (2000)
Di Gianantonio, P., Honsell, F., Lenisa, M.: RPO, second-order contexts, and λ-calculus. Logical Methods in Computer Science 5(3) (2009)
Fournet, C., Gonthier, G.: A hierarchy of equivalences for asynchronous calculi. JLAP 63(1), 131–173 (2005)
Gadducci, F., Montanari, U.: The tile model. In: Plotkin, G.D., Stirling, C., Tofte, M. (eds.) Proof, Language and Interaction: Essays in Honour of Robin Milner, pp. 133–166. MIT Press (2000)
Gadducci, F., Monreale, G.V., Montanari, U.: A modular LTS for open reactive systems. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds.) TCS 2012. LNCS, vol. 7604, pp. 134–148. Springer, Heidelberg (2012)
Honda, K., Yoshida, N.: On reduction-based process semantics. TCS 151(2), 437–486 (1995)
Kelly, G., Street, R.: Review of the elements of 2-categories. In: Sydney Category Seminar. LNM, vol. 420, pp. 75–103. Springer, Heidelberg (1974)
Klin, B., Sassone, V., Sobociński, P.: Labels from reductions: Towards a general theory. In: Fiadeiro, J.L., Harman, N., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 30–50. Springer, Heidelberg (2005)
Leifer, J.J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 243–258. Springer, Heidelberg (2000)
MacLane, S.: Categorical algebra. Bulletin of the AMS 71, 40–106 (1965)
Merro, M., Zappa Nardelli, F.: Behavioral theory for mobile ambients. JACM 52(6), 961–1023 (2005)
Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 685–695. Springer, Heidelberg (1992)
Rathke, J., Sassone, V., Sobociński, P.: Semantic barbs and biorthogonality. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 302–316. Springer, Heidelberg (2007)
Rathke, J., Sobociński, P.: Deriving structural labelled transitions for mobile ambients. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 462–476. Springer, Heidelberg (2008)
Rensink, A.: Bisimilarity of open terms. IC 156(1-2), 345–385 (2000)
Sassone, V., Sobocinski, P.: Deriving bisimulation congruences using 2-categories. Nordic Journal of Computing 10(2), 163–183 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 IFIP International Federation for Information Processing
About this paper
Cite this paper
Gadducci, F., Monreale, G.V. (2013). Barbed Semantics for Open Reactive Systems. In: MartÃ-Oliet, N., Palomino, M. (eds) Recent Trends in Algebraic Development Techniques. WADT 2012. Lecture Notes in Computer Science, vol 7841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37635-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-37635-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37634-4
Online ISBN: 978-3-642-37635-1
eBook Packages: Computer ScienceComputer Science (R0)