Unique decomposition of processes
Theoretical Computer Science
A complete axiomatization of timed bisimulation for a class of timed regular behaviours
Theoretical Computer Science
Communication and Concurrency
Process Algebra with Timing
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
The Importance of the Left Merge Operator in Process Algebras
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
CCS + Time = An Interleaving Model for Real Time Systems
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Real-Time Behaviour of Asynchronous Agents
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
A Temporal Calculus of Communicating Systems
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Real-Time Calculi and Expansion Theorems
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
A Comparison of Additivity Axioms in Timed Transition Systems.
A Comparison of Additivity Axioms in Timed Transition Systems.
A framework for performance evaluation and functional verification in stochastic process algebras
Proceedings of the 2008 ACM symposium on Applied computing
Is observational congruence on μ-expressions axiomatisable in equational Horn logic?
Information and Computation
The saga of the axiomatization of parallel composition
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
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.