Resource based models for asynchrony

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

Volumn 1378, Issue , 1998, Pages 273-287

  Rathke, J ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; MODELING LANGUAGES; POLYNOMIAL APPROXIMATION;

BISIMULATION EQUIVALENCES; BISIMULATION GAMES; BISIMULATIONS; GRAPH-BASED; POLYNOMIAL-TIME; RESOURCE-BASED; TRANSITION SYSTEM; WINNING STRATEGY;

COMPUTATION THEORY;

EID: 22044438035     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053556     Document Type: Conference Paper

References (16)

1. R. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous îr-calculus. In U. Montanari and V.Sassone, editors, Proceedings CONCUR 96, Pisa, volume 1119 of Lecture Notes in Computer Science, pages 147-162. Springer-Verlag, 1996.
2. G. Boudol. Asynchrony and the îr-calculus. Technical Report 1702, INRIA, Sophia-Antipolis, 1991.
3. S. Christensen, Y. Hirshfield, and F. Moller. Bisimulation equivalence is decidable for basic parallel processes. In E. Best, editor, Proceedings CONCUR 93, Hildesheim, volume 715 of Lecture Notes in Computer Science, pages 143-157. Springer-Verlag, 1993.
4. C. Fournet and G. Gonthier. The reflexive CHAM and the join-calculus. In Proc. ACM-POPL, 1996.
5. Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial algorithm for deciding bisimulation equivalence of normed basic parallel processes. In Proc. Mathematical Structures in Computer Science, 1996.
6. K. Honda and M. Tokoro. An object calculus for asynchronous communication. In Proc. ECOOP 91, Geneve, 1991.
7. A. Joyal, M. Nielsen, and G. Winskel. Bisimulation and open maps. In Proceedings 8th Annual Symposium on Logic in Computer Science, pages 418-427. IEEE Computer Society Press, 1993.
8. P.C. Kanellakis and S.A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86:43-68, 1990.
9. R. Milner. A complete inference system for a class of regular behaviours. Journal of Computer and System Sciences, 28:439-466, 1984.
10. R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989.
11. F. Moller. Infinite results. In U. Montanari and V.Sassone, editors, Proceedings CONCUR 96, Pisa, volume 1119 of Lecture Notes in Computer Science, pages 195-216. Springer-Verlag, 1996.
12. R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973-989,1987.
13. B. Pierce and D. Turner. Piet: A programming language based on the îr-calculus, 1996. Univeristy of Cambridge.
14. P. Selinger. First-order axioms for asynchrony. In M. Bednarczyk, editor, Proceedings CONCUR 97, Warsaw, volume 1243 of Lecture Notes in Computer Science, pages 376-390. Springer-Verlag, 1997.
15. C. Stirling. Bisimulation, model checking and other games, 1997. Notes for Mathfit Instructional Meeting on Games and Computation, University of Edinburgh.
16. G. Winskel and M. Nielsen. Models for concurrency. In S. Abramsky, Dov M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, Volume 4, pages 1-148. Oxford University Press, 1995.