State space generation for the HAVi leader election protocol
Science of Computer Programming
Global scheduler properties derived from local restrictions
Proceedings of the 2002 ACM SIGPLAN workshop on Erlang
Fundamenta Informaticae
Computer assisted manipulation of algebraic process specifications
ACM SIGPLAN Notices
On the Verification of Coordination
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
Verifying Erlang Code: A Resource Locker Case-Study
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Solving scheduling problems by untimed model checking: the clinical chemical analyser case study
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
Verifying fault-tolerant Erlang programs
Proceedings of the 2005 ACM SIGPLAN workshop on Erlang
Notions of bisimulation and congruence formats for SOS with data
Information and Computation
Verification of timed erlang/OTP components using the process algebra μcrl
ERLANG '07 Proceedings of the 2007 SIGPLAN workshop on ERLANG Workshop
Formal Verification of Timed Systems Using Cones and Foci
Electronic Notes in Theoretical Computer Science (ENTCS)
Notions of bisimulation and congruence formats for SOS with data
Information and Computation
Action abstraction in timed process algebra: the case for an untimed silent step
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Time abstraction in timed µCRL à la regions
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Verification of language based fault-tolerance
EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
Fundamenta Informaticae
An Axiomatization for Regular Processes in Timed Branching Bisimulation
Fundamenta Informaticae
| Hi-index | 0.00 |
We define a specification language called `{\it timed $\mu CRL$}''. This language is designed to describe communicating processes employing data and time. Timed $\mCRL$ is the successor of $\mCRL$ \cite{GroPo94a}. It differs in two main aspects. It is possible to make explicit reference to time using a new `{\it at}'' operator; $p\at{t}$ is the process $p$ where the first action must take place at time $t$. Furthermore, a distinction has been made between constructors and functions in the datatypes. Care has been taken that every $\mu$CRL specification is also a correct timed $\mu$CRL specification with exactly the same meaning.