Title :
Product Automata and Process Algebra
Author_Institution :
Inst. of Math. Sci.
Abstract :
We define a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is defined using a new definition of bisimulation with renaming. Concurrent mu-expressions are defined to describe labelled product systems. This leads to complete axiomatizations and algorithms for bisimulation and failure equivalence over labelled product systems, and for equality over recognizable trace languages
Keywords :
automata theory; bisimulation equivalence; process algebra; bisimulation equivalence; failure equivalence; labelled product systems; process algebra; process calculi; product automata; trace languages; Algebra; Algorithm design and analysis; Automata; Books; Business communication; Lab-on-a-chip; Libraries; Physics; Software engineering; System recovery;
Conference_Titel :
Software Engineering and Formal Methods, 2006. SEFM 2006. Fourth IEEE International Conference on
Conference_Location :
Pune
Print_ISBN :
0-7695-2678-0
DOI :
10.1109/SEFM.2006.30
