For the most recent entries see the Petri Nets Newsletter.

Proof Procedure and Answer Extraction in Petri Net Model of Logic Programs.

Peterka, G.; Murata, Tadao

In: IEEE Trans. Software Eng., Vol. 15, No. 2, pages 209-217. 1989.

Abstract: This paper discusses a proof procedure and answer extraction in a high-level Petri net model of logic programs. These programs are restricted to Horn clause subset of first order predicate logic and to finite problems.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography