• Publications
  • Influence
Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract)
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
Model checking knowledge and fixpoints
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
Update and Abstraction in Model Checking of Knowledge and Branching Time
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 hasExpand
Model checking /spl mu/-calculus in well-structured transition systems
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
Program Schemata vs. Automata for Decidability of Program Logics
  • N. Shilov
  • Computer Science
  • Theor. Comput. Sci.
  • 30 March 1997
A new technique for decidability of program logics is introduced and is applied to the most expressive propositional program logic - mu-calculus. Expand
Non-Deterministic Program Schemata and Their Relation to Dynamic Logic
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
Designing tableau-like axiomatization for Propositional Linear Temporal Logic at home of Arthur Prior
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 PLTLExpand
Engaging students with theory through ACM collegiate programming contest
How formal methods can be presented in a popular---but mathematically sound---manner to undergraduate students of various disciplines.
Combined Logics of Knowledge, Time, and Actions for Reasoning about Multi-agent Systems
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 ofExpand