Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Logic in Computer Science

arXiv:1011.6435v1 (cs)
[Submitted on 30 Nov 2010]

Title:Robustness of Equations Under Operational Extensions

Authors:Peter D. Mosses (Department of Computer Science, Swansea University), MohammadReza Mousavi (Department of Computer Science, Eindhoven University of Technology), Michel A. Reniers (Department of Computer Science, Eindhoven University of Technology)
View PDF
Abstract:Sound behavioral equations on open terms may become unsound after conservative extensions of the underlying operational semantics. Providing criteria under which such equations are preserved is extremely useful; in particular, it can avoid the need to repeat proofs when extending the specified language.
This paper investigates preservation of sound equations for several notions of bisimilarity on open terms: closed-instance (ci-)bisimilarity and formal-hypothesis (fh-)bisimilarity, both due to Robert de Simone, and hypothesis-preserving (hp-)bisimilarity, due to Arend Rensink. For both fh-bisimilarity and hp-bisimilarity, we prove that arbitrary sound equations on open terms are preserved by 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 by arbitrary disjoint extensions. Finally, we give two sets of syntactic criteria (on equations, resp. operational extensions) and prove each of them to be sufficient for preserving ci-bisimilarity.
Comments: In Proceedings EXPRESS'10, arXiv:1011.6012
Subjects: Logic in Computer Science (cs.LO)
ACM classes: F.3.2; D.3.1; D.2.1
Cite as: arXiv:1011.6435 [cs.LO]
  (or arXiv:1011.6435v1 [cs.LO] for this version)
  https://doi.org/10.48550/arXiv.1011.6435
Journal reference: EPTCS 41, 2010, pp. 106-120
Related DOI: https://doi.org/10.4204/EPTCS.41.8

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Tue, 30 Nov 2010 01:38:03 UTC (27 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.LO
< prev   |   next >
new | recent | 2010-11
Change to browse by:
cs

References & Citations

DBLP - CS Bibliography

listing | bibtex
Peter D. Mosses
Mohammad Reza Mousavi
Michel A. Reniers
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)