Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Reference40 articles.
1. A domain equation for bisimulation
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 ofLecture Notes in Computer Science, pages 478--489, Lille, France, 14-18 April 1997. Springer Verlag.
4. A category of compositional domain-models for separable Stone spaces
5. G. Bruns and P. Godefroid. Model Checking Partial State Spaces with 3-Valued Temporal Logics. InProc. of the 11th International Conference on Computer Aided Verification, volume 1633 ofLecture Notes in Computer Science, pages 274--287. Springer Verlag, July 1999.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The categorical limit of a sequence of dynamical systems;Electronic Proceedings in Theoretical Computer Science;2013-07-26
2. Modal and mixed specifications: key decision problems and their complexities;Mathematical Structures in Computer Science;2010-02
3. EXPTIME-complete Decision Problems for Modal and Mixed Specifications;Electronic Notes in Theoretical Computer Science;2009-07
4. On model checking multiple hybrid views;Theoretical Computer Science;2008-09
5. Automata Games for Multiple-model Checking;Electronic Notes in Theoretical Computer Science;2006-05