Labelled transition systems as a stone space

Logical Methods in Computer Science

Volumn 1, Issue 1, 2005, Pages

  Huth, Michael ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Hennessy Milner logic; Modal and labelled transition systems; Refinement and bisimulation; Stone space

Indexed keywords

COMPUTER CIRCUITS; SEMANTICS;

ABSTRACT INTERPRETATIONS; BISIMULATIONS; CONSISTENCY MEASURES; HAUSDORFF TOPOLOGIES; HENNESSY-MILNER LOGICS; LABELLED TRANSITION SYSTEMS; MODAL TRANSITION SYSTEMS; STONE SPACES;

TOPOLOGY;

EID: 85007020944     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-1(1:1)2005     Document Type: Article

References (43)

1. S. Abramsky. A domain equation for bisimulation. Information and Computation, 92(2):161-218, June 1991.
2. S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3, pages 1-168. Oxford Univ. Press, 1994.
3. F. Alessi, P. Baldan, and F. Honsell. Partializing Stone spaces using SFP domains. In M. Bidoit and M. Dauchet, editors, TAPSOFT’97 Conference Proceedings, volume 1214 of Lecture Notes in Computer Science, pages 478-489, Lille, France, 14-18 April 1997. Springer Verlag.
4. F. Alessi, P. Baldan, and F. Honsell. A Category of Compositional Domain-Models for Separable Stone Spaces. Theoretical Computer Science, 290(1):599-635, January 2003.
5. G. Bruns and P. Godefroid. Model Checking Partial State Spaces with 3-Valued Temporal Logics. In Proc. of the 11th International Conference on Computer Aided Verification, volume 1633 of Lecture Notes in Computer Science, pages 274-287. Springer Verlag, July 1999.
6. G. Bruns and P. Godefroid. Generalized Model Checking: Reasoning about Partial State Spaces. In Proc. of the 11th International Conference on Concurrency Theory, volume 1877 of Lecture Notes in Computer Science, pages 168-182. Springer Verlag, August 2000.
7. B. Courcelle and M. Nivat. Algebraic families of interpretations. In Proc. of the 17th IEEE Symposium on Foundations of Computer Science, pages 137-146, October 1976.
8. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs. In Proc. of the 4th ACM Symposium on Principles of Programming Languages, pages 238-252, Los Angeles, California. ACM Press, 1977.
9. D. Dams. Abstract interpretation and partition refinement for model checking. PhD thesis, Technische Universiteit Eindhoven, The Netherlands, 1996.
10. D. Dams and K. Namjoshi. The Existence of Finite Abstractions for Branching Time Model Checking. In Proc. of the Nineteenth Annual IEEE Symposium on Logic in Computer Science, pages 335-344, 13-17 July, Turku, Finland. IEEE Computer Society Press, 2004.
11. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM TOPLAS, 19:253-291, 1997.
12. J. W. de Bakker and J. I. Zucker. Denotational Semantics Of Concurrency. In Proc. 14th Annual ACM Symposium on Theory of Computing, pages 153-158, New York, New York, 1982. ACM Press.
13. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Approximating Labeled Markov Processes. In Proc. of the 15th Annual IEEE Symposium on Logic in Computer Science, pages 95-106, Santa Barbara, California, 26-29 June 2000. IEEE Computer Society Press.
14. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. The Metric Analogue of Weak Bisimulation for Probabilistic Processes. In Proc. of the 17th Annual IEEE Symposium on Logic in Computer Science, pages 413-422, Copenhagen, Denmark, July 2002. IEEE Computer Society.
15. A. Di Pierro, C. Hankin, and H. Wiklicky. Approximate Non-Interference. Journal of Computer Security, 12(1):37-82, 2004.
16. D. C. Gause and G. M. Weinberg. Exploring Requirements: Quality Before Design. Dorset House Publishing, 353 West 12th Street, New York, NY 10014, 1989.
17. G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove, and D. S. Scott. A Compendium of Continuous Lattices. Springer Verlag, 1980.
18. P. Godefroid, M. Huth, and R. Jagadeesan. Abstraction-based Model Checking using Modal Transition Systems. In Proc. of the 12th International Conference on Theory and Practice of Concurrency, volume 2154 of Lecture Notes in Computer Science, pages 426-440. Springer Verlag, August 2001.
19. P. Godefroid and R. Jagadeesan. Automatic Abstraction Using Generalized Model Checking. In E. Brinksma and K. G. Larsen, editors, Proc. of the 14th International Conference on Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, pages 137-150, Copenhagen, Denmark, July 2002. Springer Verlag.
20. P. Godefroid and R. Jagadeesan. On The Expressiveness of 3-Valued Models. In L. D. Zuck, P. C. Attie, A. Cortesi, and S. Mukhopadhyay, editors, Proc. of the 4th International Conference on Verification, Model Checking and Abstract Interpretation, volume 2575 of LNCS, pages 206-222, New York, January 2003. Springer Verlag.
21. J. A. Goguen, J. W. Thatcher, E. G. Wagner, and J. B. Wright. Initial algebra semantics and continuous algebras. Journal of the ACM, 24(1):44-67, 1977.
22. C. Gunter. The mixed power domain. Theoretical Computer Science, 103:311-334, 1992.
23. R. Heckmann. Set Domains. In Proc. of the 3rd European Symposium on Programming, volume 432 of Lecture Notes in Computer Science, pages 177-196. Springer Verlag, 1990.
24. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137-161, January 1985.
25. A. Hussain and M. Huth. On model checking multiple hybrid views. Preliminary Proc. of the First International Symposium on Leveraging Applications of Formal Method, 15 pages, 30 October-2 November, Paphos, Cyprus, 2004.
26. M. Huth, R. Jagadeesan, and D. A. Schmidt. Modal transition systems: a foundation for threevalued program analysis. In D. Sands, editor, Proc. of ESOP’2001, pages 155-169. Springer Verlag, April 2001.
27. M. Huth, R. Jagadeesan, and D. A. Schmidt. A domain equation for refinement of partial systems. Mathematical Structures in Computer Science, 14(4):469-505, Cambridge University Press, August 2004.
28. M. Huth. Refinement is complete for implementations. Revised version submitted, 27 pages, August 2004. Under review.
29. M. Huth. Beyond image-finiteness: labelled transition systems as a Stone space. In: Proc. of the Nineteenth Annual IEEE Symposium on Logic in Computer Science, pages 222-231, 13-17 July, Turku, Finland, IEEE Computer Society Press, 2004.
30. D. Jackson. Structuring Z Specifications With Views. ACM Transactions on Software Engineering and Methodology, 4(4):365-389, October 1995.
31. D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333-354, 1983.
32. K. G. Larsen. Modal Specifications. In J. Sifakis, editor, Automatic Verification Methods for Finite State Systems, number 407 in Lecture Notes in Computer Science, pages 232-246. Springer Verlag, June 12-14 1989. International Workshop, Grenoble, France.
33. K. G. Larsen and B. Thomsen. A Modal Process Logic. In Proc. of the Third Annual IEEE Symposium on Logic in Computer Science, pages 203-210. IEEE Computer Society Press, 1988.
34. J. Lawson. Spaces of Maximal Points. Mathematical Structures in Computer Science, 7(5):543-555, October 1997.
35. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
36. M. Mislove, J. Ouaknine, and J. Worrell. Axioms for Probability and Nondeterminism. Electronic Notes in Theoretical Computer Science, 65(1):21 pages, 2003.
37. R. D. Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133, 1984.
38. B. Nuseibeh, J. Kramer, and A. Finkelstein. A Framework for Expressing the Relationships Between Multiple Views in Requirements Specification. IEEE Transactions on Software Engineering, 20(10):760-773, October 1994.
39. P. Ryan, S. Schneider, M. Goldsmith, G. Lowe, and B. Roscoe. modelling and analysis of security protocols. Addison Wesley, 2001.
40. U. Sattler and M. Vardi. The Hybrid μ-calculus. In R. Goré, A. Leitsch, and T. Nipkov Proc. of the First International Joint Conference on Automated Reasoning. Lecture Notes in Computer Science 2083, pages 76-91, Siena, Italy, 18-23 June, Springer Verlag, 2001.
41. D. S. Scott. Formal semantics of programming languages, volume 2 of Courant Computer Science Symposia, chapter: Lattice theory, data types and semantics, pages 65-106. Prentice-Hall, 1972.
42. I. Sommerville, P. Sawyer, and S. Viller. Viewpoints for requirements elicitation: a practical approach. In Proc. of the 1998 International Conference on Requirements Engineering, Colorado Springs, Colorado, April 6-10 1998. IEEE Computer Society Press.
43. S. Vickers. Topology via Logic. Cambridge Tracts in Theoretical Computer Science 5, 1989.