Abstract
Symbolic transition systems are used as a basis for giving a new semantics of the 7r-calculus. This semantics is more amenable to automatic manipulation and sheds new light on the logical differences among different forms of bisimulation over dynamic process algebras. Symbolic transitions have the form P P’ where, intuitively, q’ is a boolean constraint over names that has to hold for the transition to take place, and a is a 7r-calculus action; e.g., [x = y]a•P [x-a P says that action a can be performed under any interpretation of names satisfying x = y. A symbolic bisimulation is defined on top of the symbolic transition system and it is shown that it captures the standard ones. Finally, a complete proof system is defined for symbolic bisimulation.KeywordsInference RuleProof SystemBoolean FormulaSymbolic TransitionBoolean ConstraintThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call