A rule format for associativity
2008 (English)In: CONCUR 2008 - Concurrency Theory: 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings, Berlin: Springer Berlin/Heidelberg, 2008, Vol. 5201, p. 447-461Conference paper, Published paper (Refereed)
Abstract [en]
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.
Place, publisher, year, edition, pages
Berlin: Springer Berlin/Heidelberg, 2008. Vol. 5201, p. 447-461
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 5201
Keywords [en]
Associativity, Behavioral equivalences, Binary operators, Bisimilarity, Graph isomorphisms, Van Glabbeek's spectrums
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:hh:diva-20503DOI: 10.1007/978-3-540-85361-9_35ISI: 000259487000031Scopus ID: 2-s2.0-54249112803ISBN: 978-3-540-85360-2 ISBN: 978-3-540-85361-9 ISBN: 354085360X OAI: oai:DiVA.org:hh-20503DiVA, id: diva2:585565
Conference
19th International Conference on Concurrency Theory, Toronto, CANADA, AUG 19-22, 2008
2013-01-102013-01-082018-01-11Bibliographically approved