Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation proposed by Hennessy in 1981 to the recursion, relabelling and restriction free fragment of Milner...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2005-03-01
|
| Series: | Logical Methods in Computer Science |
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/2273/pdf |
| _version_ | 1797269939185254400 |
|---|---|
| author | Luca Aceto Wan Fokkink Anna Ingolfsdottir Bas Luttik |
| author_facet | Luca Aceto Wan Fokkink Anna Ingolfsdottir Bas Luttik |
| author_sort | Luca Aceto |
| collection | DOAJ |
| description | This note shows that split-2 bisimulation equivalence (also known as timed
equivalence) affords a finite equational axiomatization over the process
algebra obtained by adding an auxiliary operation proposed by Hennessy in 1981
to the recursion, relabelling and restriction free fragment of Milner's
Calculus of Communicating Systems. Thus the addition of a single binary
operation, viz. Hennessy's merge, is sufficient for the finite equational
axiomatization of parallel composition modulo this non-interleaving
equivalence. This result is in sharp contrast to a theorem previously obtained
by the same authors to the effect that the same language is not finitely based
modulo bisimulation equivalence. |
| first_indexed | 2024-04-25T01:56:20Z |
| format | Article |
| id | doaj.art-640a68037b6e4215936c77a9181c87ec |
| institution | Directory Open Access Journal |
| issn | 1860-5974 |
| language | English |
| last_indexed | 2024-04-25T01:56:20Z |
| publishDate | 2005-03-01 |
| publisher | Logical Methods in Computer Science e.V. |
| record_format | Article |
| series | Logical Methods in Computer Science |
| spelling | doaj.art-640a68037b6e4215936c77a9181c87ec2024-03-07T17:10:13ZengLogical Methods in Computer Science e.V.Logical Methods in Computer Science1860-59742005-03-01Volume 1, Issue 110.2168/LMCS-1(1:3)20052273Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's MergeLuca AcetoWan Fokkinkhttps://orcid.org/0000-0001-7443-8978Anna IngolfsdottirBas LuttikThis note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation proposed by Hennessy in 1981 to the recursion, relabelling and restriction free fragment of Milner's Calculus of Communicating Systems. Thus the addition of a single binary operation, viz. Hennessy's merge, is sufficient for the finite equational axiomatization of parallel composition modulo this non-interleaving equivalence. This result is in sharp contrast to a theorem previously obtained by the same authors to the effect that the same language is not finitely based modulo bisimulation equivalence.https://lmcs.episciences.org/2273/pdfcomputer science - logic in computer scienced.3.1f.1.1f.1.2f.3.2f.3.4f.4.1 |
| spellingShingle | Luca Aceto Wan Fokkink Anna Ingolfsdottir Bas Luttik Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge Logical Methods in Computer Science computer science - logic in computer science d.3.1 f.1.1 f.1.2 f.3.2 f.3.4 f.4.1 |
| title | Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge |
| title_full | Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge |
| title_fullStr | Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge |
| title_full_unstemmed | Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge |
| title_short | Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge |
| title_sort | split 2 bisimilarity has a finite axiomatization over ccs with hennessy 39 s merge |
| topic | computer science - logic in computer science d.3.1 f.1.1 f.1.2 f.3.2 f.3.4 f.4.1 |
| url | https://lmcs.episciences.org/2273/pdf |
| work_keys_str_mv | AT lucaaceto split2bisimilarityhasafiniteaxiomatizationoverccswithhennessy39smerge AT wanfokkink split2bisimilarityhasafiniteaxiomatizationoverccswithhennessy39smerge AT annaingolfsdottir split2bisimilarityhasafiniteaxiomatizationoverccswithhennessy39smerge AT basluttik split2bisimilarityhasafiniteaxiomatizationoverccswithhennessy39smerge |