Testing hennessy-milner logic with recursion?

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

Volumn 1578, Issue , 1999, Pages 41-55

  Aceto, Luca ^a   Ingólfsdóttir, Anna ^a  

^a DANISH NATIONAL RESEARCH FOUNDATION   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS;

HENNESSY-MILNER LOGICS; RECURSIONS; T-TESTS;

COMPUTATION THEORY;

EID: 43449103565     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49019-1_4     Document Type: Conference Paper

References (17)

1. L. Aceto, P. Bouyer, A. Burgueño, and K. G. Larsen, The power of reach- ability testing for timed automata, in Proceedings of the Eighteenth Conference on the Foundations of Software Technology and Theoretical Computer Science, V. Arvind and R. Ramanujam, eds., Lecture Notes in Computer Science, Springer- Verlag, December 1998.
2. L. Aceto, A. Burgueño, and K. G. Larsen, Model checking via reachability testing for timed automata, in Proceedings of TACAS '98, Lisbon, B. Steffen, ed., vol. 1384 of Lecture Notes in Computer Science, Springer-Verlag, 1998, pp. 263-280.
3. H. R. Andersen, Partial model checking (extended abstract), in Proceedings of the Tenth Annual IEEE Symposium on Logic in Computer Science, San Diego, California, 26-29 June 1995, IEEE Computer Society Press, pp. 398-407.
4. R. De Nicola and M. Hennessy, Testing equivalences for processes, Theoretical Comput. Sci., 34 (1984), pp. 83-133.
5. D. M. Gabbay, A. Pnueli, S. Shelah, and J. Stavi, On the temporal basis of fairness, in Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, Las Vegas, Nevada, Jan. 1980, pp. 163-173.
6. M. Hennessy, Algebraic Theory of Processes, MIT Press, Cambridge, Massachusetts, 1988.
7. M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, J. Assoc. Comput. Mach., 32 (1985), pp. 137-161.
8. R. Keller, Formal verification of parallel programs, Comm. ACM, 19 (1976), pp. 371-384.
9. S. Kleene, Representation of events in nerve nets and finite automata, in Automata Studies, C. Shannon and J. McCarthy, eds., Princeton University Press, 1956, pp. 3-41.
10. D. Kozen, Results on the propositional mu-calculus, Theoretical Comput. Sci., 27 (1983), pp. 333-354.
11. F. Laroussinie, K. G. Larsen, and C. Weise, From timed automata to logic - and back, in Mathematical Foundations of Computer Science 1995, 20th International Symposium, J. Wiedermann and P. Hájek, eds., vol. 969 of Lecture Notes in Computer Science, Prague, Czech Republic, 28 Aug.-1 Sept. 1995, Springer-Verlag, pp. 529-539.
12. K. G. Larsen and L. Xinxin, Compositionality through an operational semantics of contexts, Journal of Logic and Computation, 1 (1991), pp. 761-795.
13. R. Milner, Communication and Concurrency, Prentice-Hall International, Englewood Cliffs, 1989.
14. th GI Conference, Karlsruhe, Germany, P. Deussen, ed., vol. 104 of Lecture Notes in Computer Science, Springer-Verlag, 1981, pp. 167-183.
15. A. Stoughton, Substitution revisited, Theoretical Comput. Sci., 59 (1988), pp. 317-325.
16. A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, 5 (1955), pp. 285-309.
17. M. Y. Vardi and P. Wolper, Reasoning about infinite computations, Information and Computation, 115 (1994), pp. 1-37.