Moshe Y. Vardi

TL;DR: In this article, the authors compare the effects of using a purely symbolic representation of the property automaton, a symbolic representation, using logarithmic encoding, of explicitly compiled property automata, and a partitioning of the symbolic state space according to an explicitly compiled automaton.

TL;DR: This work examines the branching-linear issue from the perspective of process equivalence, which is one of the most fundamental notions in concurrency theory, and postulates three principles that are fundamental to any discussion ofprocess equivalence.

TL;DR: It is demonstrated that bisimulation is practical for many designs within the automata-theoretic framework and the cost of performing this reduction still outweighs that of conventional model checking.

TL;DR: A semantic model for knowledge with the following properties is presented: knowledge is necessarily correct, agents are logically omniscient, i.e., they know all the consequences of their knowledge, and agents are positively introspective.

TL;DR: This paper shows that pushdown module checking, which is by itself harder than pushdown model checking, becomes undecidable when the environment has imperfect information, and proves that with imperfect information about the control states, but a visible pushdown store, the problem is decidable and its complexity is 2Exptime-complete for CTL and the propositional @m-calculus.