In: Proceeding of the 16th International Conference on Application and Theory of Petri Nets, Turin, June 1995., pages 357-373. 1995.
Abstract: Mazurkiewicz's traces combine the concepts of formal language theory with concurrency. The class of recognizable trace languages can be characterized by means of Zielonka's finite asynchronous automaton which is representable by a labelled safe Petri net. In this paper subclasses of the recognizable trace languages are defined by restricting the structure of the automaton. The subclasses are characterized and relations between them are examined.