Robustness of Equations Under Operational Extensions

Details Robustness of Equations Under Operational Extensions Robustness of Equations Under Operational Extensions

2010-11-30

arxiv.org/abs/1011.6435v1

EPTCS 41, 2010, pp. 106-120

Computer Science

Logic in Computer Science

In Proceedings EXPRESS'10, arXiv:1011.6012

Scientific paper

10.4204/EPTCS.41.8

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.

Affiliated with

Also associated with

No associations

Rating

Robustness of Equations Under Operational Extensions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Robustness of Equations Under Operational Extensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robustness of Equations Under Operational Extensions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-444508