Forward analysis of depth-bounded processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6014 LNCS, Issue , 2010, Pages 94-108

  Wies, Thomas ^a   Zufferey, Damien ^a   Henzinger, Thomas A ^a  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

APRIORI; COVERING PROBLEMS; FORWARD ALGORITHMS; FORWARD ANALYSIS; LARGE CLASS; MOBILE SYSTEMS; VERIFICATION PROBLEMS; WELL-STRUCTURED TRANSITION SYSTEMS;

ALGORITHMS; CALCULATIONS;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 77951495561     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12032-9_8     Document Type: Conference Paper

References (26)

1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS, pp. 313-321 (1996)
2. Amadio, R.M., Meyssonnier, C.: On decidability of the control reachability problem in the asynchronous pi-calculus. Nord. J. Comput. 9(1), 70-101 (2002)
3. Bauer, J., Wilhelm, R.: Static analysis of dynamic communication systems by partner abstraction. In: SAS, pp. 249-264 (2007)
4. Busi, N., Gabbrielli,M., Zavattaro, G.: Replication vs. recursive definitions in channel based calculi. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 133-144. Springer, Heidelberg (2003)
5. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Löding, C., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2008), http://tata.gforge.inria.fr/ (release November 18, 2008)
6. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238-252 (1977)
7. Dam, M.: Model checking mobile processes. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 22-36. Springer, Heidelberg (1993)
8. Finkel, A.: A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol. 267, pp. 499-508. Springer, Heidelberg (1987)
9. Finkel, A.: Reduction and covering of infinite reachability trees. Inf. Comput. 89(2), 144-179 (1990)
10. Finkel, A., Goubault-Larrecq, J.: Forward Analysis for WSTS, Part I: Completions. In: STACS. Dagstuhl Sem. Proc., vol. 09001, pp. 433-444 (2009)
11. Finkel, A., Goubault-Larrecq, J.: Forward Analysis for WSTS, Part II: Complete WSTS. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 188-199. Springer, Heidelberg (2009)
12. Finkel, A., Schnoebelen, P.:Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2), 63-92 (2001)
13. Geeraerts, G., Raskin, J.-F., Van Begin, L.: Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS. J. Comput. Syst. Sci. 72(1), 180-203 (2006)
14. Janssens, D., Lens, M., Rozenberg, G.: Computation graphs for actor grammars. J. Comput. Syst. Sci. 46(1), 60-90 (1993)
15. Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147-195 (1969)
16. Laver, R.: On Fraïssé's Order Type Conjecture. Ann. of Math. 93(1), 89-111 (1971)
17. Lipton, R.J.: The reachability problem requires exponential space. Technical Report 62, Yale University (1976)
18. Meyer, R.: On boundedness in depth in the pi-calculus. In: IFIP TCS. IFIP, vol. 273, pp. 477-489. Springer, Heidelberg (2008)
19. Meyer, R., Gorrieri, R.: On the relationship between pi-calculus and finite place/transition petri nets. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 463-480. Springer, Heidelberg (2009)
20. Milner, R.: Flowgraphs and flow algebras. J. ACM 26(4), 794-818 (1979)
21. Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, I. Inf. Comput. 100(1), 1-40 (1992)
22. Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, II. Inf. Comput. 100(1), 41-77 (1992)
23. Nash-Williams, C.S.J.A.: On better-quasi-ordering transfinite sequences. Proc. Camb. Phil. Soc. 64, 273-290 (1968)
24. Nešetřil, J., de Mendez, P.O.: Tree-depth, subgraph coloring and homomorphism bounds. Eur. J. Comb. 27(6), 1022-1041 (2006)
25. Ostrovský, K.: On Modelling and Analysing Concurrent Systems. PhD thesis, Chalmers University of Technology and Gotebörg University (2005)
26. Sangiorgi, D.: pi-calculus, internal mobility, and agent-passing calculi. Theor. Comput. Sci. 167(1&2), 235-274 (1996)