View source for Publications:Impossibility results for the equational theory of timed CCS

<div style='display: none'>
== Do not edit this section ==
</div>
{{PublicationSetupTemplate|Author=Luca Aceto, Anna Ingólfsdóttir, Mohammad Reza Mousavi
|PID=584514
|Name=Aceto, Luca (Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland);Ingólfsdóttir, Anna (Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland);Mousavi, Mohammad Reza [mohmou] (Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland)
|Title=Impossibility results for the equational theory of timed CCS
|PublicationType=Conference Paper
|ContentType=Refereegranskat
|Language=eng
|Journal=
|JournalISSN=
|Status=
|Volume=4624
|Issue=
|HostPublication=Algebra and Coalgebra in Computer Science : Second International Conference, CALCO 2007, Bergen, Norway, August 20-24, 2007. Proceedings
|Conference=2nd International Conference on Algebra and Coalgebra in Computer Science, Bergen, NORWAY, AUG 20-24, 2007
|StartPage=80
|EndPage=95
|Year=2007
|Edition=
|Pages=
|City=Berlin
|Publisher=Springer Berlin/Heidelberg
|Series=Lecture Notes in Computer Science ; 4624
|SeriesISSN=0302-9743
|ISBN=978-3-540-73857-2;978-3-540-73859-6
|Urls=
|ISRN=
|DOI=http://dx.doi.org/10.1007/978-3-540-73859-6_6
|ISI=000251184400006
|PMID=
|ScopusId=2-s2.0-38049088435
|NBN=urn:nbn:se:hh:diva-20496
|LocalId=
|ArchiveNumber=
|Keywords=Mathematical operators;Merging;Problem solving;Semantics;Time domain analysis
|Categories=Data- och informationsvetenskap (102)
|ResearchSubjects=
|Projects=
|Notes=
|Abstract=<p>We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR'90. Common to Wang Yi's paper, we particularly focus on a class of linearly-ordered time domains exemplified by the positive real or rational numbers. We show that, even when the set of basic actions is a singleton, there are parallel Timed CCS processes that do not have any sequential equivalent and thus improve on the Gap Theorem for Timed CCS presented by Godskesen and Larsen in FSTTCS'92. Furthermore, we show that timed bisimilarity is not finitely based both for single-sorted and two-sorted presentations of Timed CCS. We further strengthen this result by showing that, unlike in some other process algebras, adding the untimed or the timed left-merge operator to the syntax and semantics of Timed CCS does not solve the axiomatizability problem.</p>
|Opponents=
|Supervisors=
|Examiners=
|Patent=
|ThesisLevel=
|Credits=
|Programme=
|Subject=
|Uppsok=
|DefencePlace=
|DefenceLanguage=
|DefenceDate=
|CreatedDate=2013-01-08
|PublicationDate=2013-01-09
|LastUpdated=2013-02-18
|diva=http://hh.diva-portal.org/smash/record.jsf?searchId=1&pid=diva2:584514}}
<div style='display: none'>

== Keep all hand-made modifications below ==
</div>{{PublicationDisplayTemplate}}