For the most recent entries see the Petri Nets Newsletter.

Coordination Algorithms for Processes Competing in the Access to System Shared Resources.

Banaszak, Z.; Le Tu, H.Q.

In: Prace Naukowe Instytutu Cybernetyki Technicznej Politechniki Wroclawskiej, Seria: Konferencje No. 33; Second National Conference on Robotics, 1988, Wroclaw, Poland, pages 21-27. 1988. In Polish.

Abstract: Two algorithms of Petri net model synthesis are presented. The models considered encompass the deadlock-free realizations of the processes competing in the access to the system shared resources. The functions determining the computational complexity of algorithms have polynomial character.

Keywords: net synthesis; shared resources; complexity; deadlock-free.

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

Back to the Petri Nets Bibliography