Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Congruent weak bisimulation with dense real-time
Information Processing Letters
Branching bisimilarity is an equivalence indeed!
Information Processing Letters
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
An axiomatization for regular processes in timed branching bisimulation
Fundamenta Informaticae
Discrete time process algebra with silent step
Proof, language, and interaction
The cones and foci proof technique for timed transition systems
Information Processing Letters
Process Algebra with Timing
Fundamenta Informaticae
A Model for Real-Time Process Algebras (Extended Abstract)
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Behavioural Abstraction in TCCS
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Discrete Time Process Algebra with Abstraction
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
The syntax and semantics of timed $\mu CRL$
The syntax and semantics of timed $\'mu CRL$
Process Algebra: Equational Theories of Communicating Processes
Process Algebra: Equational Theories of Communicating Processes
Is timed branching bisimilarity an equivalence indeed?
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Timing the untimed: terminating successfully while being conservative
Processes, Terms and Cycles
Is Timed Branching Bisimilarity a Congruence Indeed?
Fundamenta Informaticae
Forgetting the time in timed process algebra: timeless behaviour in a timestamped world
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Is Timed Branching Bisimilarity a Congruence Indeed?
Fundamenta Informaticae
| Hi-index | 0.00 |
This paper discusses action abstraction in timed process algebras. It is observed that the leading approaches to action abstraction in timed process algebra all maintain the timing of actions, even if these actions are abstracted from. This paper presents a novel approach to action abstraction in timed process algebras. Characteristic for this approach is that in abstracting from an action, also its timing is abstracted from. We define an abstraction operator and a timed variant of rooted branching bisimilarity and establish that this notion is an equivalence relation and a congruence.