Congruent Bisimulation Equivalence of Ambient Calculus Based on Contextual Transition System
Masaki Murakami
Abstract
Masaki Murakami
Abstract
This paper presents a labeled transition system (LTS) for mobile ambients. We define labels for transitions using contexts of processes. We present a set of rules that derives transitions with contextual labels. We define bisimulation equivalence relation based on the LTS. We also show that the bisimulation equivalence is a congruence relation.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper presents a labeled transition system (LTS) for mobile ambients. We define labels for transitions using contexts of processes. We present a set of rules that derives transitions with contextual labels. We define bisimulation equivalence relation based on the LTS. We also show that the bisimulation equivalence is a congruence relation.
Key concepts: Bisimulation, Equivalence relation, Equivalence (formal languages), Transition system, Congruence relation, Congruence (geometry), Process calculus, Relation (database)