scientific article; zbMATH DE number 3932401

MaRDI QIDQ3704897zbMATH OpenFDO

Authors L. P. J. Groenewegen, H. Goeman, Jetty Kleijn, Grzegorz Rozenberg

Publication date 1983

zbMATH Keywords

Boolean expressionsconstraintscontext-free programmed languagesPetri net languagessets of placesupper bound for the language defining power

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3932400
• Petri net controlled finite automata
• Some results on Petri net languages
• scientific article; zbMATH DE number 4043256
• Selective petri net languages

Cited in

(3)

• Monotonic extensions of Petri nets: forward and backward search revisited
• scientific article; zbMATH DE number 3932400 (Why is no real title available?)
• A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application

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