Bradfield, Julian

Stirling, Colin

English

Edinburgh Research Explorer

A Calculus of Communicating Systems.

A decidable mu-calculus,

A decision procedure for the propositional µ-calculus,

A ﬁnite model theorem for the propositional µ-calculus.

A hierarchy theorem for the mu-calculus.

A near-optimal method for reasoning about action.

A temporal ﬁxpoint calculus.

Absence of interpolation and of Beth’s property in temporal logics with ‘the next’ operation.

Alternation on the binary tree,

An automata theoretic decision procedure for the propositional mu-calculus.

An automata-theoretic approach to branching-time model checking,

An elementary proof of the completeness of PDL.

and local model checking in the linear time mu-calculus.

Assigning meanings to programs.

Automata for the µ-calculus and related results.

Automatic veriﬁcation of ﬁnite-state concurrent systems using temporal logic speciﬁcations.

Bisimulation-invariant Ptime and higher-dimensional mu-calculus,

Communication and Concurrency.

Completeness of Kozen’s axiomatisation of the propositional µ-calculus.

CTL* and ECTL* as fragments of the modal mu-calculus.

Decidability of second-order theories and automata on inﬁnite trees.

Deciding the ﬁrst level of the µ-calculus alternation hierarchy,

Design and synthesis of synchronization skeletons using branching time temporal logic.

Efﬁcient model checking in fragments of the propositional mu-calculus, in:

Efﬁcient model checking via the equational mu-calculus,

Eliminating recursion in the mu-calculus,

Expressive equivalence of least and inﬂationary ﬁxed-point logic,

Finite Model Theory, 2nd edition,

Fixed point characterization of B¨ uchi automata on inﬁnite trees,

Fixpoint induction and proofs of program properties.

Fixpoints in arithmetic, transition systems and trees.

Formalization of properties of recursively deﬁned functions.

Fully local and efﬁcient evaluation of alternating ﬁxed points.

Guarded ﬁxed point logic,

How to cook a temporal proof system for your pet language.

Languages, Automata, and Logic, in: Handbook of Formal Language Theory

Local model checking for inﬁnite state spaces,

Local model checking games.

Local model checking in the modal mu-calculus.

Logical questions concerning the µ-calculus: interpolation,

Modal languages and bounded fragments of predicate logic.

Modal logic and the two-variable fragment,

On a decision method in restricted second order arithmetic.

On ﬁxed point clones,

On observing nondeterminism and concurrency,

On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic.

On the restraining power of guards.

Propositional dynamic logic of looping and converse.

Propositional dynamic logic of regular programs.

Proving the correctness of multiprocess programs.

Reasoning about the past with two-way automata,

Regular expressions for inﬁnite trees and a standard form of automata,

Results on the propositional mu-calculus.

Rudiments of µ-Calculus,

Semantical considerations of Floyd–Hoare logic.

Simplifying the modal mu-calculus alternation hierarchy,

Temporal and modal logic.

The complexity of tree automata and logics of programs.

The modal mu-calculus alternation hierarchy is strict,

The µ-calculus alternation hierarchy is strict on binary trees,

Tree automata, mu-calculus and determinacy.

Trees, automata and games.

Using Automata to Characterise Fixpoint Temporal Logics.

Veriﬁcation of Temporal Properties of Concurrent Systems,

Verifying Temporal Properties of Systems, Birkh¨ auser,

Why is modal logic so robustly decidable?,

Yet another process logic.

Modal mu-calculi

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.143.9834

Modal mu-calculi

Abstract

Similar works

Full text

Available Versions

Edinburgh Research Explorer