Share This Author
Systems and Software Verification, Model-Checking Techniques and Tools
The author provides a well written and basic introduction to the new technique model checking, which describes in simple terms the theoretical basis of model checking: transition systems as a formal model of systems, temporal logic asA formal language for behavioral properties, and model-checking algorithms.
Problems Complete for Deterministic Logarithmic Space
Separation of the Monotone NC Hierarchy
- R. Raz, P. McKenzie
- Mathematics, Computer ScienceProceedings 38th Annual Symposium on Foundations…
- 19 October 1997
A new class of communication complexity search problems is defined, referred to below as DART games, and a tight lower bound for the communication complexity of every member of this class is proved, and lower bounds for the monotone depth of many functions are got.
Systems and Software Verification
ion by state merging consists in viewing some states of an automaton as identical. We also speak of folding, or quotient. We can visualize state merging in a very concrete way: the merged states are…
Reversible space equals deterministic space
- Klaus-Jörn Lange, P. McKenzie, A. Tapp
- PhysicsProceedings of Computational Complexity. Twelfth…
- 24 June 1997
This paper describes the simulation of an S(n) space-bounded deterministic Turing machine by a reversible Turing machine operating in space S( n) and refutes the conjecture, made by M. Li and P. Vitanyi (1996), that any reversible simulation of a irreversible computation must obey Bennett's reversible pebble game rules.
Nondeterministic NC1 Computation
It is proved that boolean circuits, algebraic circuits, programs over nondeterministic finite automata, and programs over constant integer matrices yield equivalent definitions of the latter three classes, and closure properties are investigated.
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers
The problem of testing membership in the subset of the natural numbers produced at the output gate of a combinational circuit is shown to capture a wide range of complexity classes, and results extend in nontrivial ways past work by Stockmeyer and Meyer, Wagner, Wagner and Yang.
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete
- Michael Blondin, A. Finkel, Stefan Göller, C. Haase, P. McKenzie
- Mathematics30th Annual ACM/IEEE Symposium on Logic in…
- 13 December 2014
The reach ability problem for vector addition systems with states with states (VASS) is shown PSPACE-complete in the two-dimensional case, vastly improving on the doubly exponential time bound established in 1986.
Logspace and logtime leaf languages
- Birgit Jenner, P. McKenzie, D. Thérien
- Computer ScienceProceedings of IEEE 9th Annual Conference on…
- 28 June 1994
The expressibility of the leaf language mechanism is investigated in the contexts of logarithmic space and of logARithmic time computation.
The Parallel Complexity of Abelian Permutation Group Problems
It is proved that $NC^4 $ contains the problem of computing the cyclic decomposition of an Abelian permutation group, which is equivalent to determining solvability of a system of linear equations modulo a product of small prime powers.