A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
A complete axiomatisation for observational congruence of finite-state behaviours
Information and Computation
Congruent weak bisimulation with dense real-time
Information Processing Letters
An effective axiomatization for real time ACP
Information and Computation
A complete axiomatization of timed bisimulation for a class of timed regular behaviours
Theoretical Computer Science
Ntyft/ntyxt rules reduce to ntree rules
Information and Computation
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
A Model for Real-Time Process Algebras (Extended Abstract)
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Axiomatising Real-Time Processes
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Behavioural Abstraction in TCCS
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Completeness in Real Time Process Algebra
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
An Elimination Theorem for Regular Behaviours with Integration
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A Congruence Theorem for Structured Operational Semantics with Predicates
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Deciding Properties of Regular Real Time Processes
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Discrete Time Process Algebra with Abstraction
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Abstraction in Real Time Process Algebra
Proceedings of the Real-Time: Theory in Practice, REX Workshop
The syntax and semantics of timed $\mu CRL$
The syntax and semantics of timed $\'mu CRL$
Regular processes with relative time and silent steps
Regular processes with relative time and silent steps
| Hi-index | 0.00 |
Klusener introduced a timed variant of branching bisimulation. In this paper it is shown that Klusener's axioms for finite process terms, together with two standard axioms for recursion, make a complete axiomatization for regular processes modulo timed branching bisimulation.