On boundedness in depth in the π-calculus

IFIP International Federation for Information Processing

Volumn 273, Issue , 2008, Pages 477-489

  Meyer, Roland ^a  

^a UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE;

AS GRAPH; BOUNDEDNESS; CALCULUS PROCESS; NORMAL FORM; TERMINATION PROBLEMS; WELL QUASI ORDERINGS; WELL-STRUCTURED TRANSITION SYSTEMS;

CALCULATIONS;

EID: 48249156600     PISSN: 15715736     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-09680-3_32     Document Type: Conference Paper

References (19)

1. P. A. Abdulla, K. Čerans, B. Jonsson, and Y.-K. Tsay. Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation, 160(1-2):109-127, 2000.
2. R. M. Amadio and C. Meyssonnier. On decidability of the control reachability problem in the asynchronous π-calculus. Nordic Journal of Computing, 9(1):70-101, 2002.
3. L. Caires. Behavioural and spatial observations in a logic for the π-Calculus. In FOSSACS 2004, volume 2987 of LNCS, pages 72-89. Springer-Verlag, 2004.
4. M. Dam. Model checking mobile processes. Information and Computation 129(1):35-51, 1996.
5. Y. Deng and D. Sangiorgi. Ensuring termination by typability. Information and Computation, 204(7):1045-1082, 2006.
6. J. Engelfriet and T. Gelsema. Multisets and structural congruence of the pi-calculus with replication. Theoretical Computer Science, 211(1-2):311-337, 1999.
7. J. Engelfriet and T. Gelsema. Structural inclusion in the pi-calculus with replication. Theoretical Computer Science, 258(1-2):131-168, 2001.
8. J. Engelfriet and T. Gelsema. A new natural structural congruence in the pi-calculus with replication. Acta Informatica, 40(6):385-430, 2004.
9. G.-L. Ferrari, S. Gnesi, U. Montanari, and M. Pistore. A model-checking verification environment for mobile processes. ACM Transactions on Software Engineering and Methodology, 12(4):440-473, 2003.
10. A. Finkel. Reduction and covering of infinite reachability trees. Information and Computation, 89(2):144-179, 1990.
11. A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
12. A. Habel. Hyperedge Replacement: Grammars and Languages, volume 643 of LNCS. Springer-Verlag, 1992.
13. G. Higman. Ordering by divisibility in abstract algebras. Proc. London Math. Soc. (3), 2(7):326-336, 1952.
14. R. Meyer. A theory of structural stationarity in the π-Calculus. Under revision, 2008.
15. G. Milne and R. Milner. Concurrent processes and their syntax. JACM 26(2):302-321, 1979.
16. R. Milner. Flowgraphs and flow algebras. JACM, 26(4):794-818, 1979.
17. R. Milner. Communicating and Mobile Systems: The π-Calculus. Cambridge University Press, 1999.
18. D. Sangiorgi and D. Walker. The π-calculus: A Theory of Mobile Processes. Cambridge University Press, 2001.
19. N. Yoshida, M. Berger, and K. Honda. Strong normalisation in the π-Calculus. Information and Computation, 191(2):145-202, 2004.