Infinite behaviour of Petri nets

DOI10.1016/0304-3975(83)90115-9MaRDI QIDQ2265817zbMATH OpenOpenAlexFDO

Authors Ruediger Valk

Publication date 1983

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(83)90115-9

zbMATH Keywords

classes of languagesfairnessinclusion propertiesomega languagePetri net

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 4076638
• scientific article; zbMATH DE number 4024803
• scientific article; zbMATH DE number 3911720
• Petri net languages revisited
• scientific article; zbMATH DE number 4076637

Cites work

• -computations on Turing machines
• A calculus of communicating systems
• Adherences of languages
• Computation sequence sets
• Decision problems forω-automata
• scientific article; zbMATH DE number 3909750 (Why is no real title available?)
• scientific article; zbMATH DE number 3688732 (Why is no real title available?)
• scientific article; zbMATH DE number 3700252 (Why is no real title available?)
• scientific article; zbMATH DE number 3707805 (Why is no real title available?)
• scientific article; zbMATH DE number 3750300 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3501028 (Why is no real title available?)
• scientific article; zbMATH DE number 3566723 (Why is no real title available?)
• scientific article; zbMATH DE number 3572137 (Why is no real title available?)
• scientific article; zbMATH DE number 3628412 (Why is no real title available?)
• scientific article; zbMATH DE number 3060538 (Why is no real title available?)
• Parallel program schemata
• Testing and generating infinite sequences by a finite automaton
• Theories of automata on \(\omega\)-tapes: a simplified approach
• Theory of -languages. I: Characterizations of -context- free languages

Cited in

(16)

• \(X\)-automata on \(\omega\)-words
• Time-based expressivity of time Petri nets for system specification
• Fair Petri nets and structural induction for rings of processes
• Somewhat finite approaches to infinite sentences.
• On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets
• The Wadge hierarchy of Petri nets \(\omega\)-languages
• scientific article; zbMATH DE number 3911720 (Why is no real title available?)
• scientific article; zbMATH DE number 4024803 (Why is no real title available?)
• scientific article; zbMATH DE number 4076637 (Why is no real title available?)
• scientific article; zbMATH DE number 4076638 (Why is no real title available?)
• scientific article; zbMATH DE number 4098730 (Why is no real title available?)
• Petri net languages revisited
• On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
• On the high complexity of Petri nets -languages
• Transforming dynamic condition response graphs to safe Petri nets
• The residue of vector sets with applications to decidability problems in Petri nets

This page was built for publication: Infinite behaviour of Petri nets

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