loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
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
ASCII Text
x 
 
Kamal Lodaya, "Product Automata and Process Algebra," Software Engineering and Formal Methods, IEEE International Conference on, pp. 128-136, Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/SEFM.2006.30,
author = {Kamal Lodaya},
title = {Product Automata and Process Algebra},
journal ={Software Engineering and Formal Methods, IEEE International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2678-0},
pages = {128-136},
doi = {http://doi.ieeecomputersociety.org/10.1109/SEFM.2006.30},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Software Engineering and Formal Methods, IEEE International Conference on
TI - Product Automata and Process Algebra
SN - 0-7695-2678-0
SP128
EP136
A1 - Kamal Lodaya,
PY - 2006
KW - null
VL - 0
JA - Software Engineering and Formal Methods, IEEE International Conference on
ER -
 
Kamal Lodaya, The Institute of Mathematical Sciences, India
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.
Citation:
Kamal Lodaya, "Product Automata and Process Algebra," sefm, pp.128-136, Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.