For the most recent entries see the Petri Nets Newsletter.

Application of Colored Petri Net T-Invariants to Logic Programming.

Murata, Tadao; Peterka, G.

In: Proc. of the Fifth Int. Conf. on Systems Engineering, Dayton (USA), pages 381-384. New York: IEEE, 1987.

Abstract: A colored Petri net model for executing logic programs is presented. The logic programs are restricted to Horn clause subsets of first-order predicate logic and finite problems. The logic program is modeled by a colored Petri net, and the execution of the logic program corresponds to a firing sequence.


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

Back to the Petri Nets Bibliography