Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

SEFM

2006

IEEE

2006

IEEE

We deﬁne a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is deﬁned using a new deﬁnition of bisimulation with renaming. Concurrent µ-expressions are deﬁned 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. Process algebra is a large enough ﬁeld of research to have come out with its own handbook [8], but does not have the wide applicability that a ﬁeld like automata theory does. Valmari [40] points out that ideas from process algebra can usefully be applied to veriﬁcation using automata theory. Since there are a few textbooks [4, 36, 14], several monographs (with illustrious authors like Hoare [18] and Milner [28]) and a ﬁne Turing award lecture by Milner [29], that this does not commonly happen s...

Related Content

Added |
12 Jun 2010 |

Updated |
12 Jun 2010 |

Type |
Conference |

Year |
2006 |

Where |
SEFM |

Authors |
Kamal Lodaya |

Comments (0)