hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Impossibility results for the equational theory of timed CCS
Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.ORCID iD: 0000-0002-4869-6794
2007 (English)In: Algebra and Coalgebra in Computer Science: Second International Conference, CALCO 2007, Bergen, Norway, August 20-24, 2007. Proceedings, Berlin: Springer Berlin/Heidelberg, 2007, Vol. 4624, 80-95 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Berlin: Springer Berlin/Heidelberg, 2007. Vol. 4624, 80-95 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 4624
Keyword [en]
Mathematical operators, Merging, Problem solving, Semantics, Time domain analysis
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:hh:diva-20496DOI: 10.1007/978-3-540-73859-6_6ISI: 000251184400006Scopus ID: 2-s2.0-38049088435ISBN: 978-3-540-73857-2 ISBN: 978-3-540-73859-6 OAI: oai:DiVA.org:hh-20496DiVA: diva2:584514
Conference
2nd International Conference on Algebra and Coalgebra in Computer Science, Bergen, NORWAY, AUG 20-24, 2007
Available from: 2013-01-09 Created: 2013-01-08 Last updated: 2014-11-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Mousavi, Mohammad Reza
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 91 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf