Canonical transition set semantics for petri nets

  • Authors:
  • Yunhe Wang;Li Jiao

  • Affiliations:
  • State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China;State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China

  • Venue:
  • PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new partial order semantics called canonical transition set (CTS for short) semantics is proposed for P/T nets. We first prove that it is well-defined, sound and complete, and then give a state space exploring method based on it. CTS semantics provides a compressed representation for the interleaving transition sequences of finite length. Compared with other methods, the state space exploration based on CTS semantics can avoid many redundant branches and reach all states in less steps. Furthermore, we show that CTS semantics coincides with step semantics in Foata normal form [8] for pure 1-safe nets, which gives an experimental support that CTS semantics is more efficient for state space exploration. As for a special property, deadlock, we show that all deadlocks can be detected by a method combining CTS semantics with persistent set method.