Communicating sequential processes
Communicating sequential processes
A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Process algebra
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
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
The algebra of timed processes, ATP: theory and application
Information and Computation
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
A process algebra for timed systems
Information and Computation
Handbook of logic in computer science (vol. 4)
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Confluence for process verification
Theoretical Computer Science
Discrete time process algebra: absolute time, relative time and parametric time
Fundamenta Informaticae
Formal verification of a leader election protocol in process algebra
ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Discrete time process algebra with silent step
Proof, language, and interaction
Analysis of three hybrid systems in timed &mgr;CRL
Science of Computer Programming
The parallel composition of uniform processes with data
Theoretical Computer Science
The cones and foci proof technique for timed transition systems
Information Processing Letters
A Calculus of Communicating Systems
A Calculus of Communicating Systems
A Computer-Checked Verification of Milner's Scheduler
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Proof Theory for muCRL: A Language for Processes with Data
Proceedings of the International Workshop on Semantics of Specification Languages (SoSL)
A Bounded Retransmission Protocol for Large Data Packets
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Verification of Temporal Properties of Processes in a Setting with Data
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
An Enhanced Version of Timed LOTOS and its Application to a Case Study
FORTE '93 Proceedings of the IFIP TC6/WG6.1 Sixth International Conference on Formal Description Techniques, VI
Checking Verifications of Protocols and Distributed Systems by Computer
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
An Elimination Theorem for Regular Behaviours with Integration
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Invariants in Process Algebra with Data
CONCUR '94 Proceedings of the Concurrency Theory
Modelling Real-Time Behaviour with an Interval Time Calculus
Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Process Algebra Based Verification of a Production System
ICFEM '98 Proceedings of the Second IEEE International Conference on Formal Engineering Methods
Time-stamped actions in $p$CRL algebras
Time-stamped actions in $p$CRL algebras
The syntax and semantics of timed $\mu CRL$
The syntax and semantics of timed $\'mu CRL$
Undecidability and completeness results for process algebras with alternative quantification over data
Basic theorems for parallel processes in timed $\mu$CRL
Basic theorems for parallel processes in timed $\'mu$CRL
Building a simulator in the $\mu$CRL toolbox -- A case-study in modern software engineering
Building a simulator in the $\'mu$CRL toolbox -- A case-study in modern software engineering
Is Timed Branching Bisimilarity a Congruence Indeed?
Fundamenta Informaticae
| Hi-index | 0.00 |
In [25] a straightforward extension of the process algebra μCRL was proposed to explicitly deal with time. The process algebra μCRL has been especially designed to deal with data in a process algebraic context. Using the features for data, only a minor extension of the language was needed to obtain a very expressive variant of time. But [25] contains syntax, operational semantics and axioms characterising timed μCRL. It did not contain an in depth analysis of theory of timed μCRL. This paper fills this gap, by providing soundness and completeness results. The main tool to establish these is a mapping of timed to untimed μCRL and employing the completeness results obtained for untimed μCRL.