A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
A complete axiomatisation for observational congruence of finite-state behaviours
Information and Computation
Information and Computation
Process algebra
Termination, deadlock, and divergence
Journal of the ACM (JACM)
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Communication and Concurrency
A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Theories of Programming and Formal Methods
Hi-index | 0.01 |
When a process is capable of executing an unbounded number of non-observable actions it is said to be divergent. Different capabilities of an observer to identify this phenomena along the execution leads to different divergent sensitive semantics. This paper develops sound and complete axiomatisations for the divergence sensitive spectrum of weak bisimulation equivalence. The axiomatisations separates the axioms concerning recursion and those that capture the essence of diverging behaviour.