Product Automata and Process Algebra

Authors:
Kamal Lodaya
Affiliations:
The Institute of Mathematical Sciences, India
Venue:
SEFM '06 Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods
Year:
2006

Citing 0
Cited 2

A regular viewpoint on processes and algebra

Acta Cybernetica
Kleene theorems for product systems

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems

Quantified Score

Hi-index	0.00

Visualization

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 ì-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.