hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A rule format for associativity
Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands.
Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands.ORCID iD: 0000-0002-4869-6794
Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands.
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, 447-461 p.Conference 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, 447-461 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 5201
Keyword [en]
Associativity, Behavioral equivalences, Binary operators, Bisimilarity, Graph isomorphisms, Van Glabbeek's spectrums
National Category
Computer and Information Science
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: diva2:585565
Conference
19th International Conference on Concurrency Theory, Toronto, CANADA, AUG 19-22, 2008
Available from: 2013-01-10 Created: 2013-01-08 Last updated: 2014-11-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Mousavi, Mohammad Reza
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 70 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf