کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
421969 | 684994 | 2008 | 23 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasses of Petri nets for which the reachability problem is PSPACE-complete. These subclasses are not contained in any other subclass for which complexity of the reachability problem was known, such as those given in Esparza and Nielsen's survey [Esparza, J. and M. Nielsen, Decidability issues for Petri nets — a survey, J. Inform. Process. Cybernet. 30 (1994), pp. 143–160]. We give an example where further extension of our subclasses fails to maintain the upper bound.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 223, 26 December 2008, Pages 215-237
Journal: Electronic Notes in Theoretical Computer Science - Volume 223, 26 December 2008, Pages 215-237