Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • 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 (Engelska)Ingår i: 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 s.Konferensbidrag, Publicerat paper (Refereegranskat)
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.

Ort, förlag, år, upplaga, sidor
Berlin: Springer Berlin/Heidelberg, 2007. Vol. 4624, 80-95 s.
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 4624
Nyckelord [en]
Mathematical operators, Merging, Problem solving, Semantics, Time domain analysis
Nationell ämneskategori
Data- och informationsvetenskap
Identifikatorer
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
Konferens
2nd International Conference on Algebra and Coalgebra in Computer Science, Bergen, NORWAY, AUG 20-24, 2007
Tillgänglig från: 2013-01-09 Skapad: 2013-01-08 Senast uppdaterad: 2014-11-11Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas

Övriga länkar

Förlagets fulltextScopus

Personposter BETA

Mousavi, Mohammad Reza

Sök vidare i DiVA

Av författaren/redaktören
Mousavi, Mohammad Reza
Data- och informationsvetenskap

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 92 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf