Monotonic extensions of petri nets: Forward and backward search revisited

Electronic Notes in Theoretical Computer Science

Volumn 68, Issue 6, 2003, Pages 85-106

  Finkel, A ^a   Raskin, J F ^b   Samuelides, M ^a   Van Begin, L ^b  

^a CNRS   (France)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Efficient Data Structure; Extended Petri Nets; Safety Property; Symbolic Verification

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; DATA STRUCTURES; FINITE AUTOMATA; MATHEMATICAL MODELS; SET THEORY;

EFFICIENT DATA STRUCTURES; EXTENDED PETRI NETS; SAFETY PROPERTY; SYMBOLIC VERIFICATION;

PETRI NETS;

EID: 18944368649     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80535-8     Document Type: Conference Paper

References (25)

1. P. Abdulla, L. Boasson, A. Bouajjani. Effective Lossy Queue Languages. In Proc. ICALP'01, LNCS 2076, 2001.
2. Ajmone Marsan M., Balbo G., Conte G., Donatelli S., Franceschinis G. Modelling with Generalized Stochastic Petri Nets. Series in Parallel Computing. 1995;John Wiley & Sons
3. P. A. Abdulla, K. Cerāns, B. Jonsson, and Y.-K. Tsay. General Decidability Theorems for Infinite-State Systems. In Proc. LICS'96, pages 313-321, 1996.
4. K. Baukus, S. Bensalem, Y. Lakhnech, and K. Stahl. Abstracting WS1S Systems to Verify Prameterized Networks. In Proc. TACAS 2000, LNCS 1785, pages 188-203, 2000.
5. B. Bérard and L. Fribourg. Reachability analysis of (timed) Petri nets using real arithmeti In Proc. CONCUR'99, LNCS 1664, pages 178-193, 1999.
6. A. Bouajjani and R. Mayr. Model Checking Lossy Vector Addition Systems. In Proc. of STACS'99, LNCS 1563, pages 323-333. Springer, 1999.
7. G. Ciardo, A.S. Miner. Storage Alternatives for Large Structured State Space. In Proc. Modelling Techniques and Tools for Computer Performance Evaluation, LNCS 1245, pages, 44-57, 1997.
8. C. Dufourd, A. Finkel, Ph. Schnoebelen. Reset Nets Between Decidability and Undecidability. In Proc. ICALP'98, LNCS 1443, pages 103-115, 1998.
9. G. Delzanno, and J. F. Raskin. Symbolic Representation of Upward-closed Sets. In Proc. TACAS 2000, LNCS 1785, pages 426-440, 2000.
10. G. Delzanno, J.-F. Raskin, and L. Van Begin. Attacking Symbolic State Explosion. In Proc. CAV'01, LNCS 2102, pages 298-310, 2001.
11. G. Delzanno, J.-F. Raskin and L. Van Begin. Covering Sharing Trees: Efficient Data Structures for the Automated Verification of Parameterized Systems. http://www.ulb.ac.be/di/ssd/ifr/CST.ps, 2002.
12. G. Delzanno, J-F. Raskin and L. Van Begin. Towards the Automated Verification of Multithreaded Java Programs. In Proc. TACAS 2002, LNCS 2280, pages 173-187, 2002.
13. J. Esparza, A. Finkel, and R. Mayr. On the Verification of Broadcast Protocols. In Proc. LICS'99, pages 352-359, 1999.
14. Finkel A. Reduction and covering of infinite reachability trees. Information and Computation. 89:(2):1990;144-179
15. Finkel A. The minimal coverability graph for Petri nets. Advances in Petri Nets '93, LNCS 674. 1993;210-243
16. Finkel A., Schnoebelen P. Well-structured transition systems everywhere! Theoretical Computer Science. 256:(1-2):2001;63-92
17. German S.M., Sistla A.P. Reasoning about Systems with Many Processes. JACM. 39:(3):1992;675-735
18. Handy J. The Cache Memory Book. 1993;Academic Press
19. Johnson D.S. A Catalog of Complexity Classes. Van Leeuwen J. Handbook of Theoretical Computer Science, Volume A, Algorithm and Complexity. 1990;Elsevier
20. Karp R.M., Miller R.E. Parallel Program Schemata. Journal of Computer and System Sciences. 3:1969;147-195
21. P. Marenzoni, S. Caselli, G. Conte. Analysis of Large GSPN Models: A Distributed Solution Tool. In Proc. Int. Work. on Petri Nets and Performance, 1997.
22. Rackoff C. The Covering and Boundness Problem for Vector Addition Systems. Theoretical Computer Science. 6:(223):1978
23. Schnoebelen Ph. Verifying Lossy Channel Systems Has Nonprimitive Recursive Complexity. Information Processing Letters. 83:(5):2002;251-261
24. Silva M., Teruel E., Colom J.M. Linear Algebraic and Linear Programming Techniques for Analysis of Place/Transition Net Systems. Lectures on Petri Nets I: Basic Models, LNCS 1491. 1998;308-309
25. D. Zampuniéris, and B. Le Charlier. Efficient Handling of Large Sets of Tuples with Sharing Trees. In Proc. DCC'95, 1995.