Correcting a space-efficient simulation algorithm

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

Volumn 5123 LNCS, Issue , 2008, Pages 517-529

  Van Glabbeek, Rob ^a,b   Ploeger, Bas ^c  

^a CSIRO   (Australia)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; COMPUTER AIDED ANALYSIS;

COMPUTER AIDED VERIFICATION; EFFICIENT ALGORITHMS; FIXED-POINT THEORY; INTERNATIONAL CONFERENCES; KRIPKE STRUCTURES; SIMULATION ALGORITHMS; SPACE AND TIME; SPACE COMPLEXITIES; TIME COMPLEXITIES;

ALGORITHMS;

EID: 48949105173     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70545-1_49     Document Type: Conference Paper

References (20)

1. Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation can't be traced. Journal of the ACM 42(1), 232-268 (1995)
2. Bloom, B., Paige, R.: Transformational design and implementation of a new efficient solution to the ready simulation problem. Science of Computer Programming 24(3), 189-220 (1995)
3. Bustan, D., Grumberg, O.: Simulation-based minimization. ACM Transactions on Computational Logic 4(2), 181-206 (2003)
4. Courcoubetis, C., Vardi, M.Y., Wolper, P., Yannakakis, M.: Memory efficient algorithms for the verification of temporal properties. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol. 531, pp. 233-242. Springer, Heidelberg (1991)
5. Dams, D., Grumberg, O., Gerth, R.: Generation of reduced models for checking fragments of CTL. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 479-490. Springer, Heidelberg (1993)
6. Emerson, E.A., Halpern, J.Y.: "Sometimes" and "Not Never" revisited: On branching versus linear time temporal logic. Journal of the ACM 33(1), 151-178 (1986)
7. Evangelista, S., Pradat-Peyre, J.-F.: Memory efficient state space storage in explicit software model checking. In: Godefroid, P. (ed.) SPIN 2005. LNCS, vol. 3639, pp. 43-57. Springer, Heidelberg (2005)
8. Gentilini, R., Piazza, C., Policriti, A.: From bisimulation to simulation: Coarsest partition problems. Journal of Automated Reasoning 31(1), 73-103 (2003)
9. Gentilini, R., Piazza, C., Policriti, A.: From bisimulation to simulation: Coarsest partition problems. RR 12-2003, Dep. of Computer Science, University of Udine, Italy (2003)
10. van Glabbeek, R.J., Ploeger, B.: Correcting a space-efficient simulation algorithm. CS-Report 08-06, Eindhoven University of Technology (2008)
11. Groote, J.F., Vaandrager, F.W.: Structured operational semantics and bisimulation as a congruence. Information and Computation 100(2), 202-260 (1992)
12. Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), pp. 453-462. IEEE Computer Society Press, Los Alamitos (1995)
13. Holzmann, G.J.: An improved protocol reachability analysis technique. Software Practice and Experience 18(2), 137-161 (1988)
14. Kozen, D.: Results on the propositional?-calculus. Theoretical Computer Science 27, 333-354 (1983)
15. Kucera, A., Jancar, P.: Equivalence-checking on infinite-state systems: Techniques and results. Theory and Practice of Logic Programming 6(3), 227-264 (2006)
16. Loiseaux, C., Graf, S., Sifakis, J., Bouajjani, A., Bensalem, S.: Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design 6(1), 11-44 (1995)
17. Park, D.M.R.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167-183. Springer, Heidelberg (1981)
18. Ranzato, F., Tapparo, F.: A new efficient simulation equivalence algorithm. In: Proc. 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp. 171-180. IEEE Computer Society Press, Los Alamitos (2007)
19. Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Proc. 5th Annual ACM Symposium on Theory of Computing (STOC 1973), pp. 1-9. ACM, New York (1973)
20. Tan, L., Cleaveland, R.: Simulation revisited. In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol. 2031, pp. 480-495. Springer, Heidelberg (2001)