An automata-theoretic decision procedure is developed for model checking model checking for the modal logic of knowledge and linear time in distributed systems with perfect recall that yields a more precise complexity characterization.Expand

We study the model checking problem for finitely-generated synchronous/asynchronous environments with/without perfect recall for fusions of propositional logics of knowledge, common knowledge,… Expand

We present (update+abstraction) algorithm for model checking a fusion of Computation Tree Logic and Propositional Logic of Knowledge in systems with the perfect recall synchronous semantics. It has… Expand

The model checking problem for fixpoint logics in well-structured multiaction transition systems is decidable for disjunctive formulae of the propositional /spl mu/-calculus of D.A. Kozen (1983) in well,structured transition systems where propositional variables are interpreted by upward cones.Expand

A new technique for decidability of program logics is introduced and is applied to the most expressive propositional program logic - mu-calculus.Expand

Program schemata theory is a branch of theoretical computer science which deals with properties of programs with non-interpreted functional and predicate symbols and a special place belongs to so-called Janov schemes.Expand

Propositional Linear Temporal Logic (PLTL) is a very popular formalism for specification and verification of computer programs and systems. The paper suggests a tableau-like axiomatization for PLTL… Expand

We present a summary of our studies (in period 2002-2007) of the model checking problem for finitely-generated synchronous/asynchronous environments with/without perfect recall for combinations of… Expand