loading...
Extended Symbolic Transition Graphs with Assignment
Edinburgh, Scotland July 26-July 28
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/COMPSAC.2005.7629th Annual International Computer So ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Weijia Deng, Huimin Lin, "Extended Symbolic Transition Graphs with Assignment," Computer Software and Applications Conference, Annual International, vol. 1, pp. 227-232, 29th Annual International Computer Software and Applications Conference (COMPSAC'05) Volume 1, 2005.
 
 
BibTex
x
 
@article{ 10.1109/COMPSAC.2005.76,
author = {Weijia Deng and Huimin Lin},
title = {Extended Symbolic Transition Graphs with Assignment},
journal ={Computer Software and Applications Conference, Annual International},
volume = {1},
year = {2005},
issn = {0730-3157},
pages = {227-232},
doi = {http://doi.ieeecomputersociety.org/10.1109/COMPSAC.2005.76},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Software and Applications Conference, Annual International
TI - Extended Symbolic Transition Graphs with Assignment
SN - 0730-3157
SP227
EP232
A1 - Weijia Deng,
A1 - Huimin Lin,
PY - 2005
KW - Concurrent systems
KW - process algebra
KW - value-passing
KW - symbolic transition graphs
KW - verification
KW - model checking
KW - bisimulation checking
VL - 1
JA - Computer Software and Applications Conference, Annual International
ER -
 
Weijia Deng, Chinese Academy of Sciences
Huimin Lin, Chinese Academy of Sciences
An extension of symbolic transition graphs with assignment is proposed which combines the advantages of both the assignment-before-action and the assignment-after-action approaches: like the former it allows a simple set of rules to be designed for generating finite symbolic graphs from regular value-passing process descriptions; like the later it avoids creating multiple copies in the graph for a recursive process definition. Experiences show that, in most cases, considerable reductions in verification time and space can be achieved using the new approach.
Index Terms:
Concurrent systems, process algebra, value-passing,symbolic transition graphs, verification, model checking, bisimulation checking
Citation:
Weijia Deng, Huimin Lin, "Extended Symbolic Transition Graphs with Assignment," compsac, vol. 1, pp.227-232, 29th Annual International Computer Software and Applications Conference (COMPSAC'05) Volume 1, 2005
Usage of this product signifies your acceptance of the Terms of Use.