12 Modal mu-calculi
J Bradfield, C Stirling - Studies in logic and practical reasoning, 2007 - Elsevier
Publisher Summary Modal mu-calculus is a logic used extensively in certain areas of
computer science and is of considerable intrinsic mathematical and logical interest. Its …
computer science and is of considerable intrinsic mathematical and logical interest. Its …
Mathematical modal logic: A view of its evolution
R Goldblatt - Handbook of the History of Logic, 2006 - Elsevier
Publisher Summary From the early 1930s, there evolved two kinds of mathematical
semantics for modal logic. Algebraic semantics interprets modal connectives as operators …
semantics for modal logic. Algebraic semantics interprets modal connectives as operators …
[PDF][PDF] The Description Logic Handbook: Theory, Implementation, and Applications
F Baader - Cambridge University Press google schola, 2003 - courses.cs.umbc.edu
Description Logics are a family of knowledge representation languages that have been
studied extensively in Artificial Intelligence over the last two decades. They are embodied in …
studied extensively in Artificial Intelligence over the last two decades. They are embodied in …
Dynamic logic
Among the many approaches to formal reasoning about programs, Dynamic Logic enjoys
the singulax aclv~ ntage of being strongly related to classical logic. Its variants constitute …
the singulax aclv~ ntage of being strongly related to classical logic. Its variants constitute …
[图书][B] Dynamic epistemic logic
Dynamic Epistemic Logic is the logic of knowledge change. This is not about one logical
system, but about a whole family of logics that allows us to specify static and dynamic …
system, but about a whole family of logics that allows us to specify static and dynamic …
Results on the propositional μ-calculus
D Kozen - Theoretical computer science, 1983 - Elsevier
In this paper we define and study a propositional μ-calculus Lμ, which consists essentially of
propositional modal logic with a least fixpoint operator. Lμ is syntactically simpler yet strictly …
propositional modal logic with a least fixpoint operator. Lμ is syntactically simpler yet strictly …
[图书][B] Temporal verification of reactive systems: safety
Z Manna, A Pnueli - 2012 - books.google.com
This book is about the verification of reactive systems. A reactive system is a system that
maintains an ongoing interaction with its environment, as opposed to computing some final …
maintains an ongoing interaction with its environment, as opposed to computing some final …
Reasoning about infinite computations
We investigate extensions of temporal logic by connectives defined by finite automata on
infinite words. We consider three different logics, corresponding to three different types of …
infinite words. We consider three different logics, corresponding to three different types of …
Using branching time temporal logic to synthesize synchronization skeletons
EA Emerson, EM Clarke - Science of Computer programming, 1982 - Elsevier
We present a method of constructing concurrent programs in which the synchronization
skeleton of the program is automatically synthesized from a (branching time) temporal logic …
skeleton of the program is automatically synthesized from a (branching time) temporal logic …
A really temporal logic
R Alur, TA Henzinger - Journal of the ACM (JACM), 1994 - dl.acm.org
We introduce a temporal logic for the specification of real-time systems. Our logic, TPTL,
employs a novel quantifier construct for referencing time: the freeze quantifier binds a …
employs a novel quantifier construct for referencing time: the freeze quantifier binds a …