Login / Signup

Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets.

Paola AlimontiEsteban FeuersteinUmberto Nanni
Published in: LATIN (1992)
Keyphrases
  • petri net
  • computational complexity
  • conflict free
  • databases
  • sufficient conditions
  • discrete event systems
  • database
  • knowledge base
  • multi agent systems
  • high dimensional
  • colored petri nets