Communicating sequential processes
Communicating sequential processes
A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
A temporal calculus of communicating systems
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Real-time behaviour of asynchronous agents
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
The algebra of timed processes, ATP: theory and application
Information and Computation
A process algebra for timed systems
Information and Computation
A theory of processes with durational actions
AMAST '93 Selected papers of the international conference on Algebraic methodology of software technology
Timed testing of concurrent systems
Information and Computation
Timing and causality in process algebra
Acta Informatica
Absolute versus relative time in process algebras
Information and Computation - Special issue on EXPRESS 1997
Communication and Concurrency
Synthesizing Distinguishing Formulae for Real Time Systems (Extended Abstract)
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Relating Processes With Respect to Speed
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Process theory based on bisimulation semantics
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
An Overview and Synthesis on Timed Process Algebras
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Dynamic Matrices and the Cost Analysis of Concurrent Programs
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
An Algebraic Theory of Process Efficiency
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Embedding untimed into timed process algebra: the case for explicit termination
Mathematical Structures in Computer Science
Automated Synthesis of Enforcing Mechanisms for Security Properties in a Timed Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
COWS: a timed service-oriented calculus
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Synthesis of web services orchestrators in a timed setting
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
| Hi-index | 0.00 |
In this paper we contrast (the core of) four well-known process algebras specifically enriched for the specification and verification of timed systems. The aim of this comparison is twofold. On one hand it permits to gain confidence on how time and time passing are modelled in the four different timed process algebras. On the other hand, it establishes conditions under which mappings from a calculus to another can be provided which preserve (strong bisimulation-based) behavioural equivalence.