On the -language expressive power of extended Petri nets

DOI10.1016/J.TCS.2006.02.008MaRDI QIDQ2491637zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 29 May 2006

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

Full work available at URL https://doi.org/10.1016/j.tcs.2006.02.008

zbMATH Keywords

(extended) Petri nets\(\omega \)-languagesexpressiveness

Mathematics Subject Classification ID

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

Recommendations

• On the -language expressive power of extended Petri nets
• On the coverability and reachability languages of monotonic extensions of Petri nets
• A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
• On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
• On the high complexity of Petri nets -languages

Cites work

• scientific article; zbMATH DE number 1670768 (Why is no real title available?)
• scientific article; zbMATH DE number 1701757 (Why is no real title available?)
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 1223710 (Why is no real title available?)
• scientific article; zbMATH DE number 482784 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 2080048 (Why is no real title available?)
• scientific article; zbMATH DE number 1500528 (Why is no real title available?)
• scientific article; zbMATH DE number 1759422 (Why is no real title available?)
• scientific article; zbMATH DE number 1392309 (Why is no real title available?)
• Reasoning about systems with many processes
• Reduction and covering of infinite reachability trees

Cited in

(11)

• On the coverability and reachability languages of monotonic extensions of Petri nets
• The polynomial complexity of vector addition systems with states
• -Petri nets: algorithms and complexity
• On the -language expressive power of extended Petri nets
• The Wadge hierarchy of Petri nets \(\omega\)-languages
• A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
• scientific article; zbMATH DE number 4024803 (Why is no real title available?)
• Catalytic and communicating Petri nets are Turing complete
• On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
• \(\omega \)-Petri nets
• A classification of the expressive power of well-structured transition systems

This page was built for publication: On the \(\omega\)-language expressive power of extended Petri nets

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