Petruchio: From dynamic networks to nets

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

Volumn 6174 LNCS, Issue , 2010, Pages 175-179

  Meyer, Roland ^a   Strazny, Tim ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COVERABILITY; DYNAMIC NETWORK; EXPERIMENTAL EVIDENCE;

GRAPH THEORY; PETRI NETS;

COMPUTER AIDED ANALYSIS;

EID: 77954975066     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14295-6_19     Document Type: Conference Paper

References (24)

1. Abdulla, P.A., Bouajjani, A., Cederberg, J., Haziza, F., Rezine, A.: Monotonic abstraction for programs with dynamic memory heaps. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 341-354. Springer, Heidelberg (2008)
2. Abdulla, P.A., Čerans, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comp. 160(1-2), 109-127 (2000)
3. Busi, N., Gorrieri, R.: Distributed semantics for the π-calculus based on Petri nets with inhibitor arcs. JLAP 78(1), 138-162 (2009)
4. Devillers, R., Klaudel, H., Koutny, M.: A compositional Petri net translation of general π-calculus terms. For Asp. Comp. 20(4-5), 429-450 (2008)
5. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! TCS 256(1-2), 63-92 (2001)
6. HAL, http://fmt.isti.cnr.it:8080/hal/
7. Hirschkoff, D.: An extensional spatial logic for mobile processes. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 325-339. Springer, Heidelberg (2004)
8. Joshi, S., König, B.: Applying the graph minor theorem to the verification of graph transformation systems. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 214-226. Springer, Heidelberg (2008)
9. Khomenko, V., Koutny, M., Niaouris, A.: Applying Petri net unfoldings for verification of mobile systems. In: MOCA, Bericht FBI-HH-B-267/06, pp. 161-178. University of Hamburg (2006)
10. Khomenko, V., Meyer, R.: Checking π-calculus structural congruence is graph isomorphism complete. In: ACSD, pp. 70-79. IEEE, Los Alamitos (2009)
11. König, B., Kozioura, V.: Counterexample-guided abstraction refinement for the analysis of graph transformation systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 197-211. Springer, Heidelberg (2006)
12. König, B., Kozioura, V.: Incremental construction of coverability graphs. IPL 103(5), 203-209 (2007)
13. MODEL CHECKING KIT, http://www.fmi.uni-stuttgart.de/szs/tools/mckit/
14. Meyer, R.: A theory of structural stationarity in the π-calculus. Acta Inf. 46(2), 87-137 (2009)
15. Meyer, R., Gorrieri, R.: On the relationship between π-calculus and finite place/transition Petri nets. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 463-480. Springer, Heidelberg (2009)
16. Meyer, R., Khomenko, V., Strazny, T.: A practical approach to verification of mobile systems using net unfoldings. Fund. Inf. 94(3-4), 439-471 (2009)
17. NAUTY, http://cs.anu.edu.au/~bdm/nauty/
18. Orava, F., Parrow, J.: An algebraic verification of a mobile network. For. Asp. Comp. 4(6), 497-543 (1992)
19. Petruchio, http://petruchio.informatik.uni-oldenburg.de
20. Rensink, A.: Canonical graph shapes. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 401-415. Springer, Heidelberg (2004)
21. Sagiv, S., Reps, T.W., Wilhelm, R.: Parametric shape analysis via 3-valued logic. ACM TOPLAS 24(3), 217-298 (2002)
22. Saksena, M., Wibling, O., Jonsson, B.: Graph grammar modeling and verification of ad hoc routing protocols. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 18-32. Springer, Heidelberg (2008)
23. SPATIAL LOGIC MODEL CHECKER, http://ctp.di.fct.unl.pt/SLMC/
24. Wies, T., Zuffrey, D., Henzinger, T.A.: Forward analysis of depth-bounded processes. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 94-108. Springer, Heidelberg (2010)