On quasi-open bisimulation

Authors:
Yuxi Fu
Affiliations:
Department of Computer Science, Shanghai Jiaotong University, 1954 Hua Shan Road, Shanghai 200030, China
Venue:
Theoretical Computer Science
Year:
2005

Citing 12
Cited 3

Communication and concurrency

Communication and concurrency
A complete axiomatisation for observational congruence of finite-state behaviours

Information and Computation
A calculus of mobile processes, II

Information and Computation
Symbolic bisimulations

MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Algebraic theories for name-passing calculi

Information and Computation
A theory of bisimulation for the &lgr;-calculus

Acta Informatica
PI-Calculus: A Theory of Mobile Processes

PI-Calculus: A Theory of Mobile Processes
Barbed Bisimulation

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Complete Proof Systems for Observation Congruences in Finite-Control pi-Calculus

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Proof Systems for Message-Passing Process Algebras

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Unique Fixpoint Induction for Mobile Processes

CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Tau laws for pi calculus

Theoretical Computer Science

Open bisimulation, revisited

Theoretical Computer Science
Expressing first-order π-calculus in higher-order calculus of communicating systems

Journal of Computer Science and Technology
On the expressiveness of interaction

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

Quasi-open bisimilarity is a variant of the open bisimilarity based on a closer examination of the observationality of local names. The paper investigates two alternative characterizations of the quasi-open bisimilarity and provides a complete system for the weak quasi-open congruence.