On bisimilarities induced by relations on actions

Proceedings - 4th IEEE International Conference on Software Engineering and Formal Methods, SEFM 2006

Volumn , Issue , 2006, Pages 41-49

  Arun Kumar, S ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BISIMULATIONS; OBSERVATIONAL EQUIVALENCES; ON-THE-FLY ALGORITHMS; WEAK BISIMILARITY;

FAULT TOLERANCE;

FORMAL METHODS;

EID: 82655171726     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SEFM.2006.28     Document Type: Conference Paper

References (12)

1. S. Arun-Kumar and M. Hennessy. An efficiency preorder for processes. In Theoretical Aspects of Computer Software, Sendai 1991, number 526 in Lecture Notes in Computer Science, pages 152-175. SpringerVerlag, 1991.
2. S. Arun-Kumar and V. Natarajan. Conformance: A precongruence close to bisimilarity. In STRICT, Berlin 1995, number 526 in Workshops in Computing Series, pages 55-68. Springer-Verlag, 1995.
3. F. Corradini, R. Gorrieri, and M. Rocetti. Performance preorder and competitive equivalence. Acta Informatica, 34:805-835, 1997.
4. F. Corradini, W. Vogler, and L. Jenner. Comparing the worst-case efficiency of asynchronous systems with PAFAS. Acta Informatica, 38:735-792, 2002.
5. J.-C. Fernandez and L. Mounier. 'On the fly' verification of behavioural equivalences and preorders. In K.G. Larsen and A. Skou, editors, Computer Aided Verification (CAV '91), volume 575 of Lecture Notes in Computer Science, pages 181-191, Aalborg, Denmark, July 1991. Springer-Verlag.
6. L. Jenner and W. Vogler. Comparing the efficiency of asynchronous systems. Technical Report 1998-3, Universitat Augsburg, December 1998.
7. Astrid Kiehn and S. Arun-Kumar. Amortised bisimulations. In Proceedings Formal Techniques for Networked and Distributed Systems - FORTE 2005, LNCS 3731, Springer-Verlag, 2005.
8. W. Kuich and A. Salomaa. Semirings, Automata, Languages. Volume 5: EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1986.
9. G. Luettgen and W. Vogler. A faster then relation for asynchronous processes. In Proceedings CONCUR 2001, LNCS 2154, Springer-Verlag, pages 262 - 276, 2001. (Pubitemid 33326661)
10. R. Milner. Communication and Concurrency. Prentice-Hall International, 1989.
11. R. Paige and R.E. Tarjan. Three partition refinement algorithms. SIAM Journal of Computing, 16(6):973-989, December 1987.
12. D. M. R. Park. Concurrency and automata on infinite sequences. In Proceedings of the 5th GI Conference on Theoretical Computer Science, volume 104, pages 167-183. Lecture Notes in Computer Science, 1981.