The study of modal logics and various bisimulation equivalences so far shows the following progression: 1. weak bisimilarity is characterized by Hennessy-Milner logic (HML), a simple propositional modal logic with a weak possibility modality, and 2. extending HML by refining the weak possibility modality one obtains a logic which characterizes branching bisimilarity, a refinement of weak bisimilarity, and 3. further extending the logic with a divergence modality one obtains a logic which characterizes branching bisimilarity with explicit divergence, a refinement of branching bisimilarity. In this paper, we explore the development by exchanging the above 2 and 3, i.e. by first extending HML with a divergence modality and then refining the weak possibility modality in the extended logic. We have the following findings: A. extending HML with a new divergence modality one obtains a new logic which characterizes complete weak bisimilarity, an equivalence relation with distinguishing power in between weak bisimilarity and branching bisimilarity with explicit divergence; B. further extending the obtained logic by refining the weak possibility modality in it one obtains another logic which characterizes branching bisimilarity with explicit divergence. As main results of the paper, the logic in A. provides a modal characterization for complete weak bisimilarity, and moreover the two new logics in A. and B. are both sub-logics of the known logic obtained in above 3.
[1]
Rocco De Nicola,et al.
Three logics for branching bisimulation
,
1995,
JACM.
[2]
Matthew Hennessy,et al.
A Term Model for CCS
,
1980,
MFCS.
[3]
Rob J. van Glabbeek,et al.
The Linear Time - Branching Time Spectrum II
,
1993,
CONCUR.
[4]
Jan Friso Groote,et al.
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence
,
1990,
ICALP.
[5]
Scott A. Smolka,et al.
CCS expressions, finite state processes, and three problems of equivalence
,
1983,
PODC '83.
[6]
Rob J. van Glabbeek,et al.
Branching time and abstraction in bisimulation semantics
,
1996,
JACM.
[7]
Bas Luttik,et al.
Computation Tree Logic with Deadlock Detection
,
2009,
Log. Methods Comput. Sci..
[8]
Twan Basten,et al.
Branching Bisimilarity is an Equivalence Indeed!
,
1996,
Inf. Process. Lett..
[9]
David Park,et al.
Concurrency and Automata on Infinite Sequences
,
1981,
Theoretical Computer Science.
[10]
D. J. Walker,et al.
Bisimulation and Divergence
,
1990,
Inf. Comput..
[11]
Robin Milner,et al.
Algebraic laws for nondeterminism and concurrency
,
1985,
JACM.
[12]
Tingting Yu,et al.
Analyzing divergence in bisimulation semantics
,
2017,
POPL.
[13]
Bas Luttik,et al.
Branching Bisimilarity with Explicit Divergence
,
2009,
Fundam. Informaticae.