Institutional Repository

Modal logics for programs

Show simple item record

dc.contributor.author Goldblatt, R
dc.date.accessioned 2018-05-30T09:07:17Z
dc.date.available 2018-05-30T09:07:17Z
dc.date.issued 1995
dc.identifier.citation Goldblatt R (1995) Modal logics for programs. South African Computer Journal, Number 13, 1995 en
dc.identifier.issn 2313-7835
dc.identifier.uri http://hdl.handle.net/10500/24156
dc.description.abstract These lectures provide an introduction to modal logic and its use in formalising reasoning about the behaviour of computational processes. They begin with a general introduction to the syntax, semantics, and proof-theory of modal languages, and their historical origins. There then follows an exposition of some particular formalisms that are particularly relevant to computer science: dynamic logic, the temporal logic of concurrency, the Hennessy­-Milner logic of processes, and the powerful Mu-Calculus that encompasses all of these systems. The third part explains technical methods (canonical models, filtrations) that have been developed to analyse particular logics, and finally, these methods are applied to give a proof of the completeness theorem for linear temporal logic. en
dc.language.iso en en
dc.publisher South African Computer Society (SAICSIT) en
dc.subject Modal logic en
dc.subject Dynamic logic en
dc.subject Linear temporal logic en
dc.subject Branching time logics en
dc.subject Hennessy-Milner modal logic en
dc.subject Modal M Calculus en
dc.title Modal logics for programs en
dc.type Article en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UnisaIR


Browse

My Account

Statistics