scientific article; zbMATH DE number 4014038

MaRDI QIDQ3026352zbMATH OpenFDO

Authors B. L. Budinas

Publication date 1984

zbMATH Keywords

boundednessfree languagesgraphs of reachabilityPetri netstransience

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

• On the regularity of Petri net languages
• A complexity characteristic of Petri net languages
• Petri net languages revisited
• Deterministic weak-and-marked Petri net languages are regular
• On the properties of the intersection of Petri net languages and context free languages

Cited in

(3)

• Deterministic weak-and-marked Petri net languages are regular
• Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions
• Regular marked Petri nets

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 Q3026352)