Paper Info
Title
Subclasses of Recognizable Trace Languages
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.
Year
DOI
Venue
1995
10.1007/3-540-60029-9_49
Application and Theory of Petri Nets
Keywords
Field
DocType
recognizable trace languages,petri net,formal language
Asynchronous communication,Discrete mathematics,Programming language,Deterministic automaton,Petri net,Formal language,Computer science,Concurrency,Closure (mathematics),Automaton
Conference
Volume
ISSN
ISBN
935
0302-9743
3-540-60029-9
Citations 
PageRank 
References 
0
0.34
5
Authors
1
Name
Order
Citations
PageRank
Henning Reineke100.34