Causal trees

The intent of the paper is to reconcile two antagonist views on bisimulation semantics for concurrency: the interleaving approach and the approach by partial orders. The so-called causal trees are a variant of Milner's synchronisation trees with enriched action labels which supply indication of...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Darondeau, Ph, Degano, P.
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Communicate Sequential Process Operational Semantic Parallel Composition Partial Order Recursive Program
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	248
container_issue
container_start_page	234
container_title
container_volume
creator	Darondeau, Ph Degano, P.
description	The intent of the paper is to reconcile two antagonist views on bisimulation semantics for concurrency: the interleaving approach and the approach by partial orders. The so-called causal trees are a variant of Milner's synchronisation trees with enriched action labels which supply indication of the observable causes of observable actions. Concerning CCS, we construct an algebra of causal trees with two byproducts: a complete axiomatization of weak causal bisimulation between finite terms and a fully abstract model of recursive programs.
doi_str_mv	10.1007/BFb0035764
format	Book Chapter
fullrecord	<record><control><sourceid>springer</sourceid><recordid>TN_cdi_springer_books_10_1007_BFb0035764</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>springer_books_10_1007_BFb0035764</sourcerecordid><originalsourceid>FETCH-LOGICAL-c229t-fe24ebe5780977f0d4cafb4e21ab4be7e5ea823d9ad3a97ec9e0602a1e80595f3</originalsourceid><addsrcrecordid>eNpFj0FLAzEQRsdaoWvbi7_Ao5foTCaz2Rx1sSoUvCj0tiS7E1GLlU39_yoVfJfv8OCDB3BGeEmI_upmlRBZfO2O4JTFoastkkygoprIMLtwfBBC7GkzhQoZrQne8QyWpbzhD2xJsKlg0cavErfn-1G1LOAkx23R5d_O4Xl1-9Tem_Xj3UN7vTa9tWFvslqnScU3GLzPOLg-5uTUUkwuqVfR2FgeQhw4Bq99UKzRRtIGJUjmOVwcfsvn-PrxomOXdrv30hF2v4ndfyJ_A5SCPP8</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>Causal trees</title><source>Springer Books</source><creator>Darondeau, Ph ; Degano, P.</creator><contributor>Dezani-Ciancaglini, Mariangiola ; Ausiello, Giorgio ; Della Rocca, Simonetta Ronchi</contributor><creatorcontrib>Darondeau, Ph ; Degano, P. ; Dezani-Ciancaglini, Mariangiola ; Ausiello, Giorgio ; Della Rocca, Simonetta Ronchi</creatorcontrib><description>The intent of the paper is to reconcile two antagonist views on bisimulation semantics for concurrency: the interleaving approach and the approach by partial orders. The so-called causal trees are a variant of Milner's synchronisation trees with enriched action labels which supply indication of the observable causes of observable actions. Concerning CCS, we construct an algebra of causal trees with two byproducts: a complete axiomatization of weak causal bisimulation between finite terms and a fully abstract model of recursive programs.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 354051371X</identifier><identifier>ISBN: 9783540513711</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540462015</identifier><identifier>EISBN: 9783540462019</identifier><identifier>DOI: 10.1007/BFb0035764</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Communicate Sequential Process ; Operational Semantic ; Parallel Composition ; Partial Order ; Recursive Program</subject><ispartof>Automata, Languages and Programming, 1989, p.234-248</ispartof><rights>Springer-Verlag Berlin Heidelberg 1989</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c229t-fe24ebe5780977f0d4cafb4e21ab4be7e5ea823d9ad3a97ec9e0602a1e80595f3</citedby><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/BFb0035764$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/BFb0035764$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>779,780,784,793,27924,38254,41441,42510</link.rule.ids></links><search><contributor>Dezani-Ciancaglini, Mariangiola</contributor><contributor>Ausiello, Giorgio</contributor><contributor>Della Rocca, Simonetta Ronchi</contributor><creatorcontrib>Darondeau, Ph</creatorcontrib><creatorcontrib>Degano, P.</creatorcontrib><title>Causal trees</title><title>Automata, Languages and Programming</title><description>The intent of the paper is to reconcile two antagonist views on bisimulation semantics for concurrency: the interleaving approach and the approach by partial orders. The so-called causal trees are a variant of Milner's synchronisation trees with enriched action labels which supply indication of the observable causes of observable actions. Concerning CCS, we construct an algebra of causal trees with two byproducts: a complete axiomatization of weak causal bisimulation between finite terms and a fully abstract model of recursive programs.</description><subject>Communicate Sequential Process</subject><subject>Operational Semantic</subject><subject>Parallel Composition</subject><subject>Partial Order</subject><subject>Recursive Program</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>354051371X</isbn><isbn>9783540513711</isbn><isbn>3540462015</isbn><isbn>9783540462019</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>1989</creationdate><recordtype>book_chapter</recordtype><sourceid/><recordid>eNpFj0FLAzEQRsdaoWvbi7_Ao5foTCaz2Rx1sSoUvCj0tiS7E1GLlU39_yoVfJfv8OCDB3BGeEmI_upmlRBZfO2O4JTFoastkkygoprIMLtwfBBC7GkzhQoZrQne8QyWpbzhD2xJsKlg0cavErfn-1G1LOAkx23R5d_O4Xl1-9Tem_Xj3UN7vTa9tWFvslqnScU3GLzPOLg-5uTUUkwuqVfR2FgeQhw4Bq99UKzRRtIGJUjmOVwcfsvn-PrxomOXdrv30hF2v4ndfyJ_A5SCPP8</recordid><startdate>19890101</startdate><enddate>19890101</enddate><creator>Darondeau, Ph</creator><creator>Degano, P.</creator><general>Springer Berlin Heidelberg</general><scope/></search><sort><creationdate>19890101</creationdate><title>Causal trees</title><author>Darondeau, Ph ; Degano, P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c229t-fe24ebe5780977f0d4cafb4e21ab4be7e5ea823d9ad3a97ec9e0602a1e80595f3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>1989</creationdate><topic>Communicate Sequential Process</topic><topic>Operational Semantic</topic><topic>Parallel Composition</topic><topic>Partial Order</topic><topic>Recursive Program</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Darondeau, Ph</creatorcontrib><creatorcontrib>Degano, P.</creatorcontrib></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Darondeau, Ph</au><au>Degano, P.</au><au>Dezani-Ciancaglini, Mariangiola</au><au>Ausiello, Giorgio</au><au>Della Rocca, Simonetta Ronchi</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Causal trees</atitle><btitle>Automata, Languages and Programming</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>1989-01-01</date><risdate>1989</risdate><spage>234</spage><epage>248</epage><pages>234-248</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>354051371X</isbn><isbn>9783540513711</isbn><eisbn>3540462015</eisbn><eisbn>9783540462019</eisbn><abstract>The intent of the paper is to reconcile two antagonist views on bisimulation semantics for concurrency: the interleaving approach and the approach by partial orders. The so-called causal trees are a variant of Milner's synchronisation trees with enriched action labels which supply indication of the observable causes of observable actions. Concerning CCS, we construct an algebra of causal trees with two byproducts: a complete axiomatization of weak causal bisimulation between finite terms and a fully abstract model of recursive programs.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/BFb0035764</doi><tpages>15</tpages></addata></record>
fulltext	fulltext
identifier	ISSN: 0302-9743
ispartof	Automata, Languages and Programming, 1989, p.234-248
issn	0302-9743 1611-3349
language	eng
recordid	cdi_springer_books_10_1007_BFb0035764
source	Springer Books
subjects	Communicate Sequential Process Operational Semantic Parallel Composition Partial Order Recursive Program
title	Causal trees
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T23%3A59%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-springer&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Causal%20trees&rft.btitle=Automata,%20Languages%20and%20Programming&rft.au=Darondeau,%20Ph&rft.date=1989-01-01&rft.spage=234&rft.epage=248&rft.pages=234-248&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=354051371X&rft.isbn_list=9783540513711&rft_id=info:doi/10.1007/BFb0035764&rft_dat=%3Cspringer%3Espringer_books_10_1007_BFb0035764%3C/springer%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540462015&rft.eisbn_list=9783540462019&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true