Acta Mathematica Vietnamica
Search within journal
Volumes and issues
A COMPLEXITY CHARACTERISTIC OF PETRI NET LANGUAGES
PHAM TRA ANpp. 157-167
Abstract
A new complexity characteristic of Petri net languages is introduced. Some necessary conditions for Petri net languages are established and a series of simple languages not acceptable by Petri nets are given.