Computing Petri net languages by reductions

DOI10.1007/3-540-60249-6_57MaRDI QIDQ5055897zbMATH OpenOpenAlexFDO

Authors Anja Gronewold, Hans Fleischhack

Publication date 9 December 2022

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60249-6_57

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

• Petri net languages revisited
• On the regularity of Petri net languages
• scientific article; zbMATH DE number 1852166
• Petri Net Reductions for Counting Markings
• The downward-closure of Petri net languages

Cites work

• Computing Petri net languages by reductions
• scientific article; zbMATH DE number 3856413 (Why is no real title available?)
• scientific article; zbMATH DE number 3980500 (Why is no real title available?)
• scientific article; zbMATH DE number 4024805 (Why is no real title available?)
• scientific article; zbMATH DE number 4030996 (Why is no real title available?)
• scientific article; zbMATH DE number 4033100 (Why is no real title available?)
• scientific article; zbMATH DE number 4108166 (Why is no real title available?)
• Reduction and synthesis of live and bounded free choice Petri nets
• Theory of traces

Cited in

(5)

• scientific article; zbMATH DE number 4024816 (Why is no real title available?)
• Computing Petri net languages by reductions
• scientific article; zbMATH DE number 5587264 (Why is no real title available?)
• Petri Net Reductions for Counting Markings
• Accelerating the computation of dead and concurrent places using reductions

This page was built for publication: Computing Petri net languages by reductions

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