Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM'06)
Product Automata and Process Algebra
Pune, India
September 11-September 15
ISBN: 0-7695-2678-0
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 ?-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.