Tree Process Calculus

Authors:
Mingren Chai;Nan Qu;Ying Jiang
Affiliations:
State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100190, P.R.China;State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100190, P.R.China;State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100190, P.R.China
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 9
Cited 0

A complete axiomatisation for observational congruence of finite-state behaviours

Information and Computation
A calculus of broadcasting systems

ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Bisimulations for a calculus of broadcasting systems

Theoretical Computer Science
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Communication and Concurrency

Communication and Concurrency
Towards a primitive higher order calculus of broadcasting systems

Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
A Broadcast-based Calculus for Communicating Systems

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Bisimulation minimization of tree automata

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.03

Visualization

Abstract

We extend Robin Milner's sequential process calculus to tree process calculus in a way similar to that tree automata extend word automata. By this way, we establish a sound and complete inference system which describes the equivalence via bisimulation over tree processes. As a corollary, we obtain a new equivalence relation between tree automata, which is strictly finer than the classical equivalence over tree automata, and is strictly coarser than the equivalence relation via bisimulation defined in [Abdulla P.-A., L. Kaati, and J, Hogberg, Bisimulation Minimization of Tree Automata, CIAA (2006), 171-185.].