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
Robustness of equations under operational extensions
Department of Computer Science, Swansea University Singleton Park, Swansea, SA2 8PP, United Kingdom.
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.
2010 (English)In: Proceedings 17th International Workshop on Expressiveness in Concurrency / [ed] Fröschle, Sibylle; Valencia, Frank D., 2010, Vol. 41, 106-120 p.Conference paper, Published paper (Refereed)
Abstract [en]

Sound behavioral equations on open terms may become unsoundafter conservative extensions ofthe underlying operational semantics. Providing criteriaunder which such equations are preserved isextremely useful; in particular, it can avoid the need to repeat proofs when extending the specifiedlanguage.This paper investigates preservation of sound equations for several notions of bisimilarity onopen terms: closed-instance (ci-)bisimilarity and formal-hypothesis (fh-)bisimilarity, both due toRobert de Simone, and hypothesis-preserving (hp-)bisimilarity, due to Arend Rensink. For both fh-bisimilarity and hp-bisimilarity, we prove that arbitrarysound equations on open terms are preservedby all disjoint extensions which do not add labels. We also define slight variations of fh- and hp-bisimilarity such that all sound equations are preserved byarbitrary disjoint extensions. Finally, wegive two sets of syntactic criteria (on equations, resp. operational extensions) and prove each of themto be sufficient for preserving ci-bisimilarity.

Place, publisher, year, edition, pages
2010. Vol. 41, 106-120 p.
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:hh:diva-20532DOI: 10.4204/EPTCS.41.8OAI: oai:DiVA.org:hh-20532DiVA: diva2:584477
Conference
17th International Workshop (EXPRESS’10), Paris, France, August 30th, 2010
Available from: 2013-01-09 Created: 2013-01-08 Last updated: 2014-11-11Bibliographically approved

Open Access in DiVA

fulltext(143 kB)118 downloads
File information
File name FULLTEXT01.pdfFile size 143 kBChecksum SHA-512
a77f57d299f2147f0c7bf836948b25a190f1e44b1da7554fae64712bd5f3da84e25ef8996f1dead1ded1ab4536f631c2ef9b00ee632d5ee1cb1748838144e193
Type fulltextMimetype application/pdf

Other links

Publisher's full textDownload fulltext

Search in DiVA

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

Search outside of DiVA

GoogleGoogle Scholar
Total: 118 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 89 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