Constraints in deductive databases

This paper presents p-logic, an action-based logic for p-calculus. A model checker is built for this logic, following an automata-based approach. This is made possible by a result which allows finite state Labelled Transition system to be associated with a wide class of p-calculus agents by preserving a notion of be simulation equivalence. The model checker was this built rensing an efficient model checker for tha action based logic ACTL after a sound translation from p-logic into ACTL has been defined.