scientific article

zbMath0658.68070MaRDI QIDQ3806830

Heino Carstensen

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

\(\omega\)-automatainfinite behaviourdeterministic Petri nets\(\lambda\)-transitions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

On the High Complexity of Petri Nets $$\omega $$-Languages ⋮ On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets ⋮ \(X\)-automata on \(\omega\)-words ⋮ On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words