Abstract
We propose a rule format that guarantees associativity of binary operators with respect to all notions of behavioral equivalence that are defined in terms of (im)possibility of transitions, e.g., the notions below strong bisimilarity in van Glabbeek’s spectrum. The initial format is a subset of the De Simone format. We show that all trivial generalizations of our format are bound for failure. We further extend the format in a few directions and illustrate its application to several formalisms in the literature. A subset of the format is studied to obtain associativity with respect to graph isomorphism.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aceto, L., Fokkink, W., Verhoef, C.: Structural Operational Semantics. In: Handbook of Process Algebra, ch. 3, pp. 197–292. Elsevier, Amsterdam (2001)
Baeten, J.C.M., Bergstra, J.A.: Mode transfer in process algebra. Technical Report CSR-00-01, Dept. of Computer Science, TU/Eindhoven (2000)
Baeten, J.C.M., Verhoef, C.: A congruence theorem for structured operational semantics with predicates. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 477–492. Springer, Heidelberg (1993)
Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge (1990)
Bol, R., Groote, J.F.: The meaning of negative premises in transition system specifications. J. ACM 43(5), 863–914 (1996)
Brinksma, E.: A tutorial on LOTOS. In: Proc. of Protocol Specification, Testing and Verification V, pp. 171–194. North-Holland, Amsterdam (1985)
de Simone, R.: Higher-level synchronizing devices in MEIJE-SCCS. TCS 37, 245–267 (1985)
van Glabbeek, R.J.: The linear time - branching time spectrum I. In: Handbook of Process Algebra, ch.1, pp. 3–99. Elsevier, Amsterdam (2001)
van Glabbeek, R.J.: The linear time - branching time spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 66–81. Springer, Heidelberg (1993)
Hasuo, I., Jacobs, B., Sokolova, A.: The microcosm principle and concurrency in coalgebra. In: Amadio, R. (ed.) FOSSACS 2008. LNCS, vol. 4962. Springer, Heidelberg (to appear, 2008)
Milner, A.J.R.G.: A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980)
Mousavi, M.R., Reniers, M.A., Groote, J.F.: A syntactic commutativity format for SOS. IPL 93, 217–223 (2005)
Mousavi, M.R., Reniers, M.A., Groote, J.F.: Notions of bisimulation and congruence formats for SOS with data. I&C 200(1), 107–147 (2005)
Mousavi, M.R., Reniers, M.A., Groote, J.F.: SOS formats and meta-theory: 20 years after. TCS (373), 238–272 (2007)
Plotkin, G.D.: A structural approach to operational semantics. JLAP 60, 17–139 (2004)
Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1997)
Verhoef, C.: A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing 2(2), 274–302 (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cranen, S., Mousavi, M., Reniers, M.A. (2008). A Rule Format for Associativity. In: van Breugel, F., Chechik, M. (eds) CONCUR 2008 - Concurrency Theory. CONCUR 2008. Lecture Notes in Computer Science, vol 5201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85361-9_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-85361-9_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85360-2
Online ISBN: 978-3-540-85361-9
eBook Packages: Computer ScienceComputer Science (R0)