Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Unfoldings of Unbounded Petri Nets Parosh Aziz Abdulla 1 , S. Purushothaman Iyer 2 , and Aletta Nyl'en 1
 

Summary: Unfoldings of Unbounded Petri Nets
Parosh Aziz Abdulla 1 , S. Purushothaman Iyer 2 , and Aletta Nyl'en 1
1 Dept. of Computer Systems
P.O. Box 325
Uppsala University
S­751 05 Uppsala, Sweden
fparosh,alettag@docs.uu.se
2 Dept of Computer Science
NC State University
Raleigh, NC 27695­7534
purush@csc.ncsu.edu
Abstract. Net unfoldings have attracted much attention as a powerful
technique for combating state space explosion in model checking. The
method has been applied to verification of 1­safe (finite) Petri nets, and
more recently also to other classes of finite­state systems such as syn­
chronous products of finite transition systems. We show how unfoldings
can be extended to the context of infinite­state systems. More precisely,
we apply unfoldings to get an efficient symbolic algorithm for checking
safety properties of unbounded Petri nets. We demonstrate the advan­
tages of our method by a number of experimental results.

  

Source: Abdulla, Parosh Aziz - Department of Information Technology, Uppsala Universitet

 

Collections: Computer Technologies and Information Sciences