منابع مشابه
Coalgebras and Modal Logic
Coalgebras are of growing importance in theoretical computer science. To develop languages for them is significant for the speciication and veriication of systems modelled with them. Modal logic has proved to be suitable for this purpose. So far, most approaches have presented a language to describe only deterministic coalgebras. The present paper introduces a generalization that also covers no...
متن کاملCoalgebras and Modal Logic
1 These lecture notes were written mainly during my stay as an ERCIM fellow at the Masaryk University, Brno, Czech Republic. I owe special thanks to Lubo s Brim, Ji r Rosick y, and the Faculty for Informatics. Preface These course notes present universal coalgebra as a general theory of systems. By`system' we understand some entity running in and communicating with an environment. We also assum...
متن کاملCoalgebras, Stone Duality, Modal Logic
A brief outline of the topics of the course could be as follows. Coalgebras generalise transition systems. Modal logics are the natural logics for coalgebras. Stone duality provides the relationship between coalgebras and modal logic. Furthermore, some basic category theory is needed to understand coalgebras as well as Stone duality. So we will need to learn something about modal logic, about S...
متن کاملCoalgebras and Modal Logic for Parameterised Endofunctor
We study categories of coalgebras for endofunctors, which additionally depend on a parameter category. The corresponding category of coalgebras then naturally appears as cofibred over the parameters. We give examples of constructions in the cofibred framework and study the overall structure of such cofibrations. Moreover, the dependency of (modal) logics for coalgebras on a parameter category i...
متن کاملSemantical Principles in the Modal Logic of Coalgebras
Coalgebras for a functor on the category of sets subsume many formulations of the notion of transition system, including labelled transition systems, Kripke models, Kripke frames and many types of automata. This paper presents a multimodal language which is bisimulation invariant and (under a natural completeness condition) expressive enough to characterise elements of the underlying state spac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2000
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80353-6