Wan Fokkink
Rob van Glabbeek
ABSTRACT
Earlier we presented a method to decompose modal formulas for processes with the internal action τ; congruence formats for branching and η-bisimilarity were derived on the basis of this decomposition method. The idea is that a congruence format for a semantics must ensure that formulas in the modal characterisation of this semantics are always decomposed into formulas in this modal characterisation. Here the decomposition method is enhanced to deal with modal characterisations that contain a modality 〈ϵ〉〈a〉φ, to derive congruence formats for delay and weak bisimilarity.
- B. Bloom. Structural operational semantics for weak bisimulations. Theor. Comput. Sci. 146:25--68, 1995. Google Scholar
Digital Library
- B. Bloom, W. Fokkink, R. van Glabbeek. Precongruence formats for decorated trace semantics. ACM TOCL 5:26--78, 2004. Google ScholarDigital Library
- B. Bloom, S. Istrail, A. Meyer. Bisimulation can't be traced. J. ACM 42:232--268, 1995. Google ScholarDigital Library
- R. Bol, J.F. Groote. The meaning of negative premises in transition system specifications. J. ACM 43:863--914, 1996 Google ScholarDigital Library
- W. Fokkink. Rooted branching bisimulation as a congruence. J. Comput. Syst. Sci. 60:13--37, 2000. Google ScholarDigital Library
- W. Fokkink, R. van Glabbeek. Ntyft/ntyxt rules reduce to ntree rules. Inform. Comput. 126:1--10, 1996. Google ScholarDigital Library
- W. Fokkink, R. van Glabbeek. Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarity. Technical report 9351, NICTA, 2016. http://arxiv.org/abs/1604.07530.Google Scholar
- W. Fokkink, R. van Glabbeek, P. de Wind. Compositionality of Hennessy-Milner logic by structural operational semantics. Theor. Comput. Sci. 354:421--440, 2006. Google ScholarDigital Library
- W. Fokkink, R. van Glabbeek, P. de Wind. Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity. Inf. Comp. 214:59--85, 2012. Google ScholarDigital Library
- D. Gebler, W. Fokkink. Compositionality of probabilistic Hennessy-Milner logic through structural operational semantics. In CONCUR, LNCS 7454, pp. 395--409. Springer, 2012. Google ScholarDigital Library
- A. van Gelder, K. Ross, J.S. Schlipf. The well-founded semantics for general logic programs. J. ACM 38:620--650, 1991. Google ScholarDigital Library
- R. van Glabbeek. The linear time-branching time spectrum II: The semantics of sequential systems with silent moves. In CONCUR, LNCS 715, pp. 66--81. Springer, 1993. Google ScholarDigital Library
- R. van Glabbeek. The meaning of negative premises in transition system specifications II. J. Logic Algebr. Progr. 60/61:229--258, 2004.Google ScholarCross Ref
- R. van Glabbeek. On cool congruence formats for weak bisimulations. Theor. Comput. Sci., 412:3283--3302, 2011.Google ScholarCross Ref
- J.F. Groote. Transition system specifications with negative premises. Theor. Comput. Sci. 118:263--299, 1993. Google ScholarDigital Library
- J.F. Groote, F. Vaandrager. Structured operational semantics and bisimulation as a congruence. Inform. Comput. 100:202--260, 1992. Google ScholarDigital Library
- M. Hennessy, R. Milner. Algebraic laws for non-determinism and concurrency. J. ACM 32:137--161, 1985. Google ScholarDigital Library
- K. Larsen, X. Liu. Compositionality through an operational semantics of contexts. J. Logic Comput. 1:761--795, 1991.Google ScholarCross Ref
- R. Milner. A modal characterisation of observable machinebehaviour. In CAAP, LNCS 112, pp. 25--34. Springer, 1981. Google ScholarDigital Library
- R. Milner. Communication and Concurrency. Prentice Hall, 1989. Google ScholarDigital Library
- R. de Simone. Higher-level synchronising devices in Meije-SCCS. Theor. Comput. Sci. 37:245--267, 1985.Google ScholarCross Ref
- I. Ulidowski. Equivalences on observable processes. In LICS, pp. 148--159, IEEE, 1992.Google ScholarCross Ref
- I. Ulidowski, I. Phillips. Ordered SOS rules and process languages for branching and eager bisimulations. Inform. Comput., 178:180--213, 2002. Google ScholarDigital Library
- I. Ulidowski, S. Yuen. Process languages for rooted eager bisimulation. In CONCUR, LNCS 1877, pp. 275--289, Springer, 2000. Google ScholarDigital Library
Recommendations
Divide and congruence II
Earlier we presented a method to decompose modal formulas for processes with the internal action , and congruence formats for branching and -bisimilarity were derived on the basis of this decomposition method. The idea is that a congruence format for a ...
Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity
We present a method for decomposing modal formulas for processes with the internal action @t. To decide whether a process algebra term satisfies a modal formula, one can check whether its subterms satisfy formulas that are obtained by decomposing the ...
Divide and Congruence Applied to η-Bisimulation
We present congruence formats for @h- and rooted @h-bisimulation equivalence. These formats are derived using a method for decomposing modal formulas in process algebra. To decide whether a process algebra term satisfies a modal formula, one can check ...
Comments