Rational and recognizable complex trace languages

DOI10.1006/inco.1995.1010zbMath0818.68073OpenAlexW2081163032MaRDI QIDQ1346721

Volker Diekert, Antoine Petit, Paul Gastin

Publication date: 10 April 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1010

zbMATH Keywords

complex trace languagesconcurrent iteration

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Forward analysis and model checking for trace bounded WSTS ⋮ On projective and separable properties ⋮ Petri boxes and finite precedence ⋮ An algorithmic approach for checking closure properties of Ω-regular languages ⋮ Synchronization expressions with extended join operation ⋮ An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages

This page was built for publication: Rational and recognizable complex trace languages