From many places to few: Automatic abstraction refinement for petri nets

Fundamenta Informaticae

Volumn 88, Issue 3, 2008, Pages 275-305

  Ganty, Pierre ^a   Raskin, Jean Franois ^a   Van Begin, Laurent ^a,b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b FNRS   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT INTERPRETATIONS; ABSTRACTION REFINEMENTS; AUTOMATIC REFINEMENTS; AUTOMATIC VERIFICATIONS; HIGH DIMENSIONALITIES; STATE SPACES;

GRAPH THEORY; MARINE BIOLOGY; PETRI NETS;

ABSTRACTING;

EID: 58149508172     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (26)

1. Abdulla, P. A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems, LICS '96: Proc. 11th Annual IEEE Symp. on Logic in Computer Science, IEEE Computer Society, 1996.
2. Abdulla, P. A., Iyer, S. P., Nylén, A.: Unfoldings of Unbounded Petri Nets., CAV '00: Proc. 12th Int. Conf. on Computer Aided Verification, 1855, Springer, 2000.
3. Berthelot, G., Roucairol, G., Valk, R.: Reductions of Nets and Parallel Prgrams, Advanced Course: Net Theory and Applications, 84, Springer, 1975.
4. Burris, S., Sankappanavar, H. P.: A Course in Universal Algebra, Springer, New York, 1981.
5. Ciardo, G., Miner, A.: Storage Alternatives for Large Structured State Space, Proc. Computer Performance Evaluation 1997: 9th Int. Conf. on Modelling Techniques and Tools, 1245, Springer, 1997.
6. Clarke, E. M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking, J. ACM, 50(5), 2003, 752-794.
7. Cousot, P.: Semantic Foundations of Program Analysis, in: Program Flow Analysis: Theory and Applications (S. Muchnick, N. Jones, Eds.), chapter 10, Prentice-Hall, Inc., 1981, 303-342.
8. Cousot, P.: Partial Completeness of Abstract Fixpoint Checking, invited paper, SARA '00: Proc. 4th Int. Symp. on Abstraction, Reformulations and Approximation, 1864, Springer, 2000.
9. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, POPL '77: Proc. 4th ACM SIGACT-SIGPLAN Symp. on Principles of Programming Languages, ACM Press, 1977.
10. Delzanno, G., Raskin, J.-F., Van Begin, L.: Attacking Symbolic State Explosion, CAV '01: Proc. 13th Int. Conf. on Computer Aided Verification, 2102, Springer, 2001.
11. Dickson, L. E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors, Amen J. Math., 35, 1913, 413-422.
12. Evangelista, S., Haddad, S., Pradat-Peyre, J.-F: Syntactical Colored Petri Nets Reductions, ATVA '05: Proc. 3rd IntṠympon Automated Technology for Verification and Analysis, 3707, Springer, 2005.
13. Finkel, A.: The minimal coverability graph for Petri nets, APN '93: Proc. I4th Int. Conf. on Application and Theory of Petri Nets, 674, Springer, 1993.
14. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere!, Theoretical Computer Science, 256(1-2), 2001, 63-92.
15. Ganty, P., Meuter, C. Delzanno, G., Kalyon, G., Raskin, J.-F., Van Begin, L.: Symbolic Data Structure for sets of k-uples, Technical report, Université Libre de Bruxelles, Belgium, 2007.
16. Ganty, P., Raskin, J.-F., Van Begin, L.: A Complete Abstract Interpretation Framework for Coverability Properties of WSTS, VMCAI '06: Proc. 7th Int. Conf on Verification, Model Checking and Abstract Interpretation, 3855, Springer, 2006.
17. Ganty, P., Raskin, J.-F., Van Begin, L.: From Many Places to Few: Automatic Abstraction Refinement for Petri Nets, ICATPN '07: Proc, of 28th Int. Conf. on Application and Theory of Petri Nets and Other Models of Concurrency, 4546, Springer, 2007.
18. Geeraerts, G., Raskin, J.-F., Van Begin, L.: Expand, Enlarge and Check: new algorithms for the coverability problem of WSTS, FSTTCS '04: Proc. 24th Int. Conf. on Fondation of Software Technology and Theoretical Computer Science, 3328, Springer, 2004.
19. Geeraerts, G., Raskin, J.-F., Van Begin, L.: On the efficient Computation of the Minimal Coverability set of Petri nets, ATVA '07: Proc. 5th Int. Symp. on Automated Technology for Verification and Analysis, 4762, Springer, 2007.
20. German, S. M., Sistla, A. P.: Reasoning about Systems with Many Processes, Journal of ACM, 39(3), 1992, 675-735.
21. Grahlmann, B.: ThePEPTool, CAV'97: Proc. 9th Int. Conf. on Computer Aided Verification, 1254, Springer, 1997.
22. Karp, R. M., Miller, R. E.: Parallel Program Schemata., Journal of Comput. Syst. Sci., 3(2), 1969, 147-195.
23. Manolopoulos, Y: Binomial coefficient computation: Recursion or Iteration, ACM SIGCSE Bulletin, 34(4), 2002, 65-67.
24. Marsan, M. A., Balbo, G., Conte, G., Donatelli, S., Franceschinis, G.: Modelling with Generalized Stochastic Petri Nets, Wiley series in parallel computing, Wiley, 1995.
25. Park, D.: Fixpoint Induction and Proofs of Program Properties, in: Machine Intelligence, vol. 5, American Elsevier, 1969, 59-78.
26. Van Begin, L.: Efficient Verification of Counting Abstractions for Parametric systems, Ph.D. Thesis, Université Libre de Bruxelles, Belgium, 2003.