DocumentCode :
478238
Title :
Deciding Algorithm for Simulation Equivalence on MTIPP
Author :
Zhao, Xiying
Author_Institution :
Software Eng. Dept., Lanzhou Polytech. Coll., Lanzhou
Volume :
3
fYear :
2008
fDate :
18-20 Oct. 2008
Firstpage :
619
Lastpage :
622
Abstract :
To relieve state space explosion, various proposals for compositional reduction have been made. Simulation equivalence is a equivalence relation that coarse than bisimulation on process algebras. So it is a more meaningful working to deciding whether two processes simulation equivalence. In this paper, we have given the notions of (strong and weak) simulation equivalence, offered the deciding algorithms for simulations equivalence on process algebras MTIPP and addressed the computational complexity of our algorithms.
Keywords :
computational complexity; process algebra; MTIPP process algebras; computational complexity; deciding algorithm; processes simulation equivalence; Algebra; Computational complexity; Computational modeling; Educational institutions; Explosions; Iterative algorithms; Software algorithms; Software engineering; State-space methods; Stochastic processes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Natural Computation, 2008. ICNC '08. Fourth International Conference on
Conference_Location :
Jinan
Print_ISBN :
978-0-7695-3304-9
Type :
conf
DOI :
10.1109/ICNC.2008.318
Filename :
4667211
Link To Document :
بازگشت