𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Branching time and orthogonal bisimulation equivalence

✍ Scribed by Jan A. Bergstra; Alban Ponse; Mark B. van der Zwaag

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
609 KB
Volume
309
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

We propose a reΓΏnement of branching bisimulation equivalence that we call orthogonal bisimulation equivalence. Typically, internal activity (the performance of -steps) may be compressed, but not completely discarded. Hence, a process with -steps cannot be equivalent to one without -steps. Also, we present a modal characterization of orthogonal bisimulation equivalence. This equivalence is a congruence for ACP extended with abstraction and priority operators. We provide a complete axiomatization, and describe some expressiveness results. Finally, we present the veriΓΏcation of a PAR protocol that is speciΓΏed with use of priorities.

πŸ“œ SIMILAR VOLUMES

Localization, equivalence and transferab
Localization, equivalence and transferability of non-orthogonal localized molecular orbitals
✍ Xiaoping Cao; Jiazhen Wang πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 456 KB

By introducing the definition of the reciprocal basis vector, the unit operator can be established, allowing vectors and operators to be represented in matrix form, and the solution of equations can be reduced to a series of basis vector transformations. By using this method and discarding the const

Prediction in Branching Time Logic
Prediction in Branching Time Logic
✍ Giacomo Bonanno πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 168 KB