Equations, Contractions, and Unique Solutions

One of the most studied behavioural equivalences is bisimilarity. Its success is much due to the associated bisimulation proof method, which can be further enhanced by means of “bisimulation up-to” techniques such as “up-to context.” A different proof method is discussed, based on a unique solution...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ACM transactions on computational logic 2017-04, Vol.18 (1), p.1-30
1. Verfasser: Sangiorgi, Davide
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 30
container_issue 1
container_start_page 1
container_title ACM transactions on computational logic
container_volume 18
creator Sangiorgi, Davide
description One of the most studied behavioural equivalences is bisimilarity. Its success is much due to the associated bisimulation proof method, which can be further enhanced by means of “bisimulation up-to” techniques such as “up-to context.” A different proof method is discussed, based on a unique solution of special forms of inequations called contractions and inspired by Milner’s theorem on unique solution of equations. The method is as powerful as the bisimulation proof method and its “up-to context” enhancements. The definition of contraction can be transferred onto other behavioural equivalences, possibly contextual and non-coinductive. This enables a coinductive reasoning style on such equivalences, either by applying the method based on unique solution of contractions or by injecting appropriate contraction preorders into the bisimulation game. The techniques are illustrated in CCS-like languages; an example dealing with higher-order languages is also shown.
doi_str_mv 10.1145/2971339
format Article
fullrecord <record><control><sourceid>hal_cross</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_01647063v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_HAL_hal_01647063v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-c335t-124059e9527ae56ccbe1369217802a39f1c4ab64b56a884dcdfa6dfd6e4386bc3</originalsourceid><addsrcrecordid>eNo9UE1LxDAUDKLguop_oTcRrObl5aM5LsvqCgUPuuAtvKYpVmrrNq3gv9e6xdN8MDOHYewS-C2AVHfCGkC0R2wBSpnUSvV6PHFhUzSZOmVnMb5zDsKgWLB0sx9pqLs23iTrrh168rOitkx2bb0fQ_LcNeOfe85OKmpiuJhxyXb3m5f1Ns2fHh7Xqzz1iGpIQUiubLBKGApKe18EQG0FmIwLQluBl1RoWShNWSZLX1aky6rUQWKmC49Ldn3YfaPGffb1B_XfrqPabVe5mzwOWhqu8Qt-s1eHrO-7GPtQ_ReAu-kRNz-CP7JFUOc</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Equations, Contractions, and Unique Solutions</title><source>ACM Digital Library Complete</source><creator>Sangiorgi, Davide</creator><creatorcontrib>Sangiorgi, Davide</creatorcontrib><description>One of the most studied behavioural equivalences is bisimilarity. Its success is much due to the associated bisimulation proof method, which can be further enhanced by means of “bisimulation up-to” techniques such as “up-to context.” A different proof method is discussed, based on a unique solution of special forms of inequations called contractions and inspired by Milner’s theorem on unique solution of equations. The method is as powerful as the bisimulation proof method and its “up-to context” enhancements. The definition of contraction can be transferred onto other behavioural equivalences, possibly contextual and non-coinductive. This enables a coinductive reasoning style on such equivalences, either by applying the method based on unique solution of contractions or by injecting appropriate contraction preorders into the bisimulation game. The techniques are illustrated in CCS-like languages; an example dealing with higher-order languages is also shown.</description><identifier>ISSN: 1529-3785</identifier><identifier>EISSN: 1557-945X</identifier><identifier>DOI: 10.1145/2971339</identifier><language>eng</language><publisher>Association for Computing Machinery</publisher><subject>Computation and Language ; Computer Science</subject><ispartof>ACM transactions on computational logic, 2017-04, Vol.18 (1), p.1-30</ispartof><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c335t-124059e9527ae56ccbe1369217802a39f1c4ab64b56a884dcdfa6dfd6e4386bc3</citedby><cites>FETCH-LOGICAL-c335t-124059e9527ae56ccbe1369217802a39f1c4ab64b56a884dcdfa6dfd6e4386bc3</cites><orcidid>0000-0001-5823-3235</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,314,776,780,881,27901,27902</link.rule.ids><backlink>$$Uhttps://inria.hal.science/hal-01647063$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Sangiorgi, Davide</creatorcontrib><title>Equations, Contractions, and Unique Solutions</title><title>ACM transactions on computational logic</title><description>One of the most studied behavioural equivalences is bisimilarity. Its success is much due to the associated bisimulation proof method, which can be further enhanced by means of “bisimulation up-to” techniques such as “up-to context.” A different proof method is discussed, based on a unique solution of special forms of inequations called contractions and inspired by Milner’s theorem on unique solution of equations. The method is as powerful as the bisimulation proof method and its “up-to context” enhancements. The definition of contraction can be transferred onto other behavioural equivalences, possibly contextual and non-coinductive. This enables a coinductive reasoning style on such equivalences, either by applying the method based on unique solution of contractions or by injecting appropriate contraction preorders into the bisimulation game. The techniques are illustrated in CCS-like languages; an example dealing with higher-order languages is also shown.</description><subject>Computation and Language</subject><subject>Computer Science</subject><issn>1529-3785</issn><issn>1557-945X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><recordid>eNo9UE1LxDAUDKLguop_oTcRrObl5aM5LsvqCgUPuuAtvKYpVmrrNq3gv9e6xdN8MDOHYewS-C2AVHfCGkC0R2wBSpnUSvV6PHFhUzSZOmVnMb5zDsKgWLB0sx9pqLs23iTrrh168rOitkx2bb0fQ_LcNeOfe85OKmpiuJhxyXb3m5f1Ns2fHh7Xqzz1iGpIQUiubLBKGApKe18EQG0FmIwLQluBl1RoWShNWSZLX1aky6rUQWKmC49Ldn3YfaPGffb1B_XfrqPabVe5mzwOWhqu8Qt-s1eHrO-7GPtQ_ReAu-kRNz-CP7JFUOc</recordid><startdate>20170413</startdate><enddate>20170413</enddate><creator>Sangiorgi, Davide</creator><general>Association for Computing Machinery</general><scope>AAYXX</scope><scope>CITATION</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0001-5823-3235</orcidid></search><sort><creationdate>20170413</creationdate><title>Equations, Contractions, and Unique Solutions</title><author>Sangiorgi, Davide</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c335t-124059e9527ae56ccbe1369217802a39f1c4ab64b56a884dcdfa6dfd6e4386bc3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Computation and Language</topic><topic>Computer Science</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Sangiorgi, Davide</creatorcontrib><collection>CrossRef</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><jtitle>ACM transactions on computational logic</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sangiorgi, Davide</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Equations, Contractions, and Unique Solutions</atitle><jtitle>ACM transactions on computational logic</jtitle><date>2017-04-13</date><risdate>2017</risdate><volume>18</volume><issue>1</issue><spage>1</spage><epage>30</epage><pages>1-30</pages><issn>1529-3785</issn><eissn>1557-945X</eissn><abstract>One of the most studied behavioural equivalences is bisimilarity. Its success is much due to the associated bisimulation proof method, which can be further enhanced by means of “bisimulation up-to” techniques such as “up-to context.” A different proof method is discussed, based on a unique solution of special forms of inequations called contractions and inspired by Milner’s theorem on unique solution of equations. The method is as powerful as the bisimulation proof method and its “up-to context” enhancements. The definition of contraction can be transferred onto other behavioural equivalences, possibly contextual and non-coinductive. This enables a coinductive reasoning style on such equivalences, either by applying the method based on unique solution of contractions or by injecting appropriate contraction preorders into the bisimulation game. The techniques are illustrated in CCS-like languages; an example dealing with higher-order languages is also shown.</abstract><pub>Association for Computing Machinery</pub><doi>10.1145/2971339</doi><tpages>30</tpages><orcidid>https://orcid.org/0000-0001-5823-3235</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1529-3785
ispartof ACM transactions on computational logic, 2017-04, Vol.18 (1), p.1-30
issn 1529-3785
1557-945X
language eng
recordid cdi_hal_primary_oai_HAL_hal_01647063v1
source ACM Digital Library Complete
subjects Computation and Language
Computer Science
title Equations, Contractions, and Unique Solutions
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T03%3A42%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Equations,%20Contractions,%20and%20Unique%20Solutions&rft.jtitle=ACM%20transactions%20on%20computational%20logic&rft.au=Sangiorgi,%20Davide&rft.date=2017-04-13&rft.volume=18&rft.issue=1&rft.spage=1&rft.epage=30&rft.pages=1-30&rft.issn=1529-3785&rft.eissn=1557-945X&rft_id=info:doi/10.1145/2971339&rft_dat=%3Chal_cross%3Eoai_HAL_hal_01647063v1%3C/hal_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true