Efficient minimization up to location equivalence

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

Volumn 1058, Issue , 1996, Pages 265-279

  Montanari, Ugo ^a   Pistore, Marco ^a   Yankelevich, Daniel ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSIDAD DE BUENOS AIRES   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; LOCATION;

BISIMULATIONS; LABELED TRANSITION SYSTEMS; MINIMAL REALIZATIONS; PARTITIONING ALGORITHMS; PROCESS CALCULI; SINGLE-AGENT; STANDARD ALGORITHMS; TRANSITION SYSTEM;

SOFTWARE AGENTS;

EID: 77955720466     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61055-3_42     Document Type: Conference Paper

References (16)

1. L. Aceto. A static view of localities. INRIA Report 1483, 1991. To appear in Formal Aspects of Computing.
2. G. Berry and G. Boudol. The chemical abstract machine. In Proc. POPL. ACM, 1990.
3. G. Boudol, I. Castellani, M. Hennessy and A. Kiehn. Observing localities. Theoretical Computer Science, 114: 31-61, 1993.
4. G. Boudol, I. Castellani, M. Hennessy and A. Kiehn. A theory of processes with localities. INRIA Report 1632, 1991. Extended abstract in Proc. CONCUR'92, LNCS 630, 1992.
5. I. Castellani. Observing distribution in processes: static and dynamic localities. INRIA Report 2276, 1994.
6. F. Corradini and R. De Nicola. Distribution and locality of concurrent systems. In Proc. ICALP'94, LNCS 920, pages 154-165. Springer Verlag, 1994.
7. P. Inverardi and C. Priami. Evaluation of tools for the analysis of communicating systems. In Bullettin of EATCS, 45, 1991.
8. A. Kiehn. Local and global causes. Tech. Rep. 42/23/91, Institut für Informatik, TU München, 1991.
9. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
10. R. Milner. The polyadic π-calculus: a tutorial. In Logic and Algebra of Specification, NATO ASI Series F, Vol. 94. Springer Verlag, 1993.
11. U. Montanari and D. Yankelevich. A parametric approach to localities. In Proc. ICALP'92, LNCS 623. Springer Verlag, 1992.
12. U. Montanari and D. Yankelevich. Location Equivalence in a Parametric Setting. Theoretical Computer Science, 149: 299-332, 1995.
13. R. Paige and R.E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
14. D. Yankelevich. Parametric Views of Process Description Languages. PhD Thesis. Dipartimento di Informatica, Universitá di Pisa, 1993. Available as report TD-23/93.
15. Proceedings of the Conference on Computer-Aided Verification-CAV'95, LNCS 939. P. Wolper Ed., Springer Verlag, 1995.
16. Proceedings of the International Symposium on Protocol Specification, Testing and Verification-PSTV'95. IFIP WG 6. 1, 1995.