A theory of name boundedness

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

Volumn 8052 LNCS, Issue , 2013, Pages 182-196

  Hüchting, Reiner ^a   Majumdar, Rupak ^b   Meyer, Roland ^a  

^a University of Koblenz Landau   (Germany)

^b MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADDRESS SPACE; ALGORITHMIC ANALYSIS; CALCULUS PROCESS; DECIDABILITY PROPERTIES; KARP-MILLER TREES; RECONFIGURABLE SYSTEMS; RESOURCE CONSTRAINT; SEQUENTIAL PROCESS;

PETRI NETS;

COMPUTABILITY AND DECIDABILITY;

EID: 84882794008     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40184-8_14     Document Type: Conference Paper

References (20)

1. Amadio, R., Meyssonnier, C.: On decidability of the control reachability problem in the asynchronous π-calculus. Nord. J. Comp. 9(1), 70-101 (2002)
2. Bansal, K., Koskinen, E., Wies, T., Zufferey, D.: Structural counter abstraction. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 62-77. Springer, Heidelberg (2013)
3. Busi, N., Gorrieri, R.: Distributed semantics for the π-calculus based on Petri nets with inhibitor arcs. J. Log. Alg. Prog. 78(1), 138-162 (2009)
4. Busi, N., Zavattaro, G.: Deciding reachability problems in Turing-complete fragments of Mobile Ambients. Math. Struct. Comp. Sci. 19(6), 1223-1263 (2009)
5. Dam, M.: Model checking mobile processes. Inf. Comp. 129(1), 35-51 (1996)
6. Devillers, R., Klaudel, H., Koutny, M.: A compositional Petri net translation of general π-calculus terms. For. Asp. Comp. 20(4-5), 429-450 (2008)
7. Finkel, A., Goubault-Larrecq, J.: The theory of WSTS: The case of complete WSTS. In: Haddad, S., Pomello, L. (eds.) PETRI NETS 2012. LNCS, vol. 7347, pp. 3-31. Springer, Heidelberg (2012)
8. He, C.: The decidability of the reachability problem for CCS! In: Katoen, J.-P., König, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 373-388. Springer, Heidelberg (2011)
9. Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147-195 (1969)
10. Lipton, R.J.: The reachability problem requires exponential space. Technical report, Yale University, Department of Computer Science (1976)
11. Mayr, E.W., Meyer, A.R.: The complexity of the finite containment problem for Petri nets. JACM 28(3), 561-576 (1981)
12. Meyer, R.: On boundedness in depth in the π-calculus. In: IFIP TCS. IFIP, vol. 273, pp. 477-489. Springer, Heidelberg (2008)
13. Meyer, R.: A theory of structural stationarity in the π-calculus. Acta Inf. 46(2), 87-137 (2009)
14. 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)
15. Meyer, R., Khomenko, V., Hüchting, R.: A polynomial translation of π-calculus (FCP) to safe Petri nets. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 440-455. Springer, Heidelberg (2012)
16. Milner, R.: Communicating and Mobile Systems: the π-Calculus. CUP (1999)
17. Montanari, U., Pistore, M.: Checking bisimilarity for finitary π-calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 42-56. Springer, Heidelberg (1995)
18. Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comp. Sci. 6(2), 223-231 (1978)
19. Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. CUP (2001)
20. Wies, T., Zufferey, 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)