Generic forward and backward simulations

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

Volumn 4137 LNCS, Issue , 2006, Pages 406-420

  Hasuo, Ichiro ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATION THEORY; COMPUTER SIMULATION; CONCURRENT ENGINEERING; PROBABILISTIC LOGICS; THEOREM PROVING;

BACKWARD SIMULATION; FORWARD SIMULATION; GENERIC THEORY; PROBABILISTIC SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33749570348     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817949_27     Document Type: Conference Paper

References (18)

1. L. Cheung. Reconciling Nondeterministic and Probabilistic Choices. PhD thesis, Radboud Univ. Nijmegen, 2006.
2. M. Fiore. A coinduction principle for recursive data types based on bisimulation. Inf. & Comp., 127(2):186-198, 1996.
3. S. Garland, N. Lynch, and M. Vaziri. 10A: a language for specifying, programming, and validating distributed systems. MIT Laboratory for Computer Science, 1997.
4. I. Hasuo and B. Jacobs. Context-free languages via coalgebraic trace semantics. In Algebra and Coalgebra in Computer Science (CALCO'05), volume 3629 of Lect. Notes Comp. Sci., pages 213-231. Springer, Berlin, 2005.
5. I. Hasuo, B. Jacobs, and A. Sokolova. Generic trace theory. In Coalgebraic Methods in Computer Science (CMCS 2006), Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2006.
6. I. Hasuo. Generic forward and backward simulations. Technical report, Research Center for Verification and Semantics, National Institute of Advanced Industrial Science and Technology (AIST), Japan, 2006. http://www.cs.ru.nl/ ~ichiro/papers/.
7. J. Hughes and B. Jacobs. Simulations in coalgebra. Theor. Comp. Sci., 327(1-2):71-108, 2004.
8. C. Jou and S. Smolka. Equivalences, congruences and complete axiomatizations for probabilistic processes. In CONCUR'90, volume 458 of Lect. Notes Comp. Sci., pages 367-383. Springer-Verlag, 1990.
9. Y. Kawabe, K. Mano, H. Sakurada, and Y. Tsukada. Backward simulations for anonymity. In International Workshop on Issues in the Theory of Security (WITS '06), 2006.
10. Y. Kinoshita and J. Power. Data refinement and algebraic structure. Acta Informatica, 36:693-719, 2000.
11. N. Klarlund and F. Schneider. Verifying safety properties using infinite-state automata. Technical Report 89-1039, Department of Computer Science, Cornell University, Ithaca, New York, 1989.
12. N. Lynch and F. Vaandrager. Forward and backward simulations. I. Untimed systems. Inf. & Comp., 121(2):214-233, 1995.
13. J. Power and D. Turi. A coalgebraic foundation for linear time semantics. In Category Theory and Computer Science, number 29 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 1999.
14. J. Rutten. Universal coalgebra: a theory of systems. Theor. Comp. Sci., 249:3-80, 2000.
15. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journ. Comput., 2(2):250-273, 1995.
16. A. Sokolova. Coalgebraic Analysis of Probabilistic Systems. PhD thesis, TU Eindhoven, 2005.
17. R. van Glabbeek, S. Smolka, and B. Steffen. Reactive, generative, and stratified models of probabilistic processes. Inf. & Comp., 121:59-80, 1995.
18. S.H. Wu, S.A. Smolka, and E.W. Stark. Composition and behaviors of probabilistic I/O automata. Theor. Comp. Sci., 176(1-2):1-38, 1997.