For the most recent entries see the Petri Nets Newsletter.

A Survey of Recognizable Languages of Infinite Traces.

Gastin, Paul; Petit, Antoine

In: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 609; Advances in Petri Nets 1992, pages 392-409. Springer-Verlag, 1992.

Abstract: A. Mazurkiewicz defined traces in order to represent non-sequential processes. In order to describe non-sequential processes which never terminate, e.g. distributed operating systems, the notion of infinite traces is needed. The aim of this survey is to present in a uniform way the results on recognizable infinite trace languages stated in various other works. The proofs of the presented results are not proposed here but can be found in the original papers.

Keywords: semantics of concurrent processes; infinite traces; recognizable languages.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography