In: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 424; Advances in Petri Nets 1989, pages 354-373. Berlin, Germany: Springer-Verlag, 1990.
Abstract: The author investigates the concurrent behaviour of elementary net sytems in terms of partial word languages. The author obtaines its definability by existential sentences of the monadic second order logic. The class of these languages of lambda-free labeled EN systems is closed under conjunction, disjunction and projection but not under complementation. This implies that existential sentences of the considered logic do not necessarily define the behaviour of these EN systems. A similar study is made for unlabeled EN systems, too.
Keywords: definability; elementary net system; concurrent behaviour; logical specification.