scientific article; zbMATH DE number 4076638

MaRDI QIDQ3806830zbMATH OpenFDO

Authors Heino Carstensen

Publication date 1988

zbMATH Keywords

infinite behaviour\(\omega\)-automatadeterministic 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)

Recommendations

• Infinite behaviour of Petri nets
• scientific article; zbMATH DE number 4035163
• scientific article; zbMATH DE number 3911720
• scientific article; zbMATH DE number 3982529
• Deterministic weak-and-marked Petri net languages are regular

Cited in

(8)

• Infinite behaviour of Petri nets
• On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets
• \(X\)-automata on \(\omega\)-words
• Determinization of timed Petri nets behaviors
• scientific article; zbMATH DE number 4035163 (Why is no real title available?)
• Infinite Process Semantics of Inhibitor Nets
• On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
• On the high complexity of Petri nets \(\omega \)-languages

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3806830)