https://wiki.hh.se/ceres/index.php?action=history&feed=atom&title=Publications%3ARobustness_of_equations_under_operational_extensions 2026-04-03T22:26:01Z Revision history for this page on the wiki MediaWiki 1.22.6 https://wiki.hh.se/ceres/index.php?title=Publications:Robustness_of_equations_under_operational_extensions&diff=4129&oldid=prev 2014-06-26T03:43:34Z

<p>Created page with &quot;&lt;div style=&#039;display: none&#039;&gt; == Do not edit this section == &lt;/div&gt; {{PublicationSetupTemplate|Author=P. D. Mosses, Mohammad Reza Mousavi, M. A. Reniers |PID=584477 |Name=Mosses...&quot;</p> <p><b>New page</b></p><div>&lt;div style='display: none'&gt;<br /> == Do not edit this section ==<br /> &lt;/div&gt;<br /> {{PublicationSetupTemplate|Author=P. D. Mosses, Mohammad Reza Mousavi, M. A. Reniers<br /> |PID=584477<br /> |Name=Mosses, P. D. (Department of Computer Science, Swansea University Singleton Park, Swansea, SA2 8PP, United Kingdom);Mousavi, Mohammad Reza [mohmou] (Department of Computer Science, Eindhoven University of Technology P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands);Reniers, M. A. (Department of Computer Science, Eindhoven University of Technology P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands)<br /> |Title=Robustness of equations under operational extensions<br /> |PublicationType=Conference Paper<br /> |ContentType=Refereegranskat<br /> |Language=eng<br /> |Journal=<br /> |JournalISSN=<br /> |Status=<br /> |Volume=41<br /> |Issue=<br /> |HostPublication=Proceedings 17th International Workshop on Expressiveness in Concurrency<br /> |Conference=17th International Workshop (EXPRESS’10), Paris, France, August 30th, 2010<br /> |StartPage=106<br /> |EndPage=120<br /> |Year=2010<br /> |Edition=<br /> |Pages=<br /> |City=<br /> |Publisher=<br /> |Series=<br /> |SeriesISSN=<br /> |ISBN=<br /> |Urls=http://arxiv.org/pdf/1011.6435.pdf<br /> |ISRN=<br /> |DOI=http://dx.doi.org/10.4204/EPTCS.41.8<br /> |ISI=<br /> |PMID=<br /> |ScopusId=<br /> |NBN=urn:nbn:se:hh:diva-20532<br /> |LocalId=<br /> |ArchiveNumber=<br /> |Keywords=<br /> |Categories=Data- och informationsvetenskap (102)<br /> |ResearchSubjects=<br /> |Projects=<br /> |Notes=<br /> |Abstract=&lt;p&gt;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.&lt;/p&gt;<br /> |Opponents=<br /> |Supervisors=<br /> |Examiners=<br /> |Patent=<br /> |ThesisLevel=<br /> |Credits=<br /> |Programme=<br /> |Subject=<br /> |Uppsok=<br /> |DefencePlace=<br /> |DefenceLanguage=<br /> |DefenceDate=<br /> |CreatedDate=2013-01-08<br /> |PublicationDate=2013-01-09<br /> |LastUpdated=2013-02-26<br /> |diva=http://hh.diva-portal.org/smash/record.jsf?searchId=1&amp;pid=diva2:584477}}<br /> &lt;div style='display: none'&gt;<br /> <br /> == Keep all hand-made modifications below ==<br /> &lt;/div&gt;{{PublicationDisplayTemplate}}</div>

Slawek