Author:
Finkel A.,Raskin J.-F.,Samuelides M.,Van Begin L.
Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. P. Abdulla, L. Boasson, A. Bouajjani. Effective Lossy Queue Languages. In Proc. ICALP'01, LNCS 2076, 2001.
2. Modelling with Generalized Stochastic Petri Nets;Ajmone Marsan,1995
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.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Logical View on Continuous Petri Nets;ACM Transactions on Computational Logic;2017-08-21
2. Approaching the Coverability Problem Continuously;Tools and Algorithms for the Construction and Analysis of Systems;2016
3. When to Move to Transfer Nets;Programming Languages with Applications to Biology and Security;2015
4. A Widening Approach to Multithreaded Program Verification;ACM Transactions on Programming Languages and Systems;2014-10-28
5. Efficient Coverability Analysis by Proof Minimization;Lecture Notes in Computer Science;2012