DocumentCode
2850654
Title
Symmetry in Process Algebra
Author
Jiang, Jianmin ; Wu, Jinzhao ; Shu, Hongping
Author_Institution
Fujian Normal Univ., Fuzhou
fYear
2007
fDate
6-8 June 2007
Firstpage
450
Lastpage
462
Abstract
An original notion of symmetry for process algebra is defined, which is based on permutation groups. Given a process which is regarded as a structure and a permutation group on it, the quotient process (reduced process) is showed to be interleaving trace equivalent and interleaving bisimulation equivalent to the original process. Furthermore, an algorithm and two examples for this symmetric reduction are presented.
Keywords
bisimulation equivalence; formal languages; group theory; process algebra; bisimulation equivalent interleaving; permutation groups; process algebra language; quotient process; symmetric reduction; trace equivalent interleaving; Algebra; Computer applications; Computer science; Concurrent computing; Formal specifications; Formal verification; Information technology; Interleaved codes; Software systems; State-space methods; Process algebra; behavioral equivalences.; groups; permutation; symmetry;
fLanguage
English
Publisher
ieee
Conference_Titel
Theoretical Aspects of Software Engineering, 2007. TASE '07. First Joint IEEE/IFIP Symposium on
Conference_Location
Shanghai
Print_ISBN
978-0-7695-2856-4
Type
conf
DOI
10.1109/TASE.2007.49
Filename
4239988
Link To Document