Impossibility results for the equational theory of timed CCS

Tyck till om SwePub Sök här!

Aceto, Luca (författare): Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland

Ingólfsdóttir, Anna (författare): Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland

Mousavi, Mohammad Reza (författare): Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland

(creator_code:org_t)

Berlin : Springer Berlin/Heidelberg, 2007
2007
Engelska.
Ingår i: Algebra and Coalgebra in Computer Science. - Berlin : Springer Berlin/Heidelberg. - 9783540738572 - 9783540738596 ; , s. 80-95

Relaterad länk:: https://pure.tue.nl/...; visa fler...; https://urn.kb.se/re...; https://doi.org/10.1...; visa färre...

Abstract Ämnesord

Stäng

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.

Av författaren/redakt...: Aceto, Luca; Ingólfsdóttir, A ...; Mousavi, Mohamma ...

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.