Learning of finite coded Petri net languages

MaRDI QIDQ3620787zbMATH OpenFDO

Authors S. Kannamma, K. Rangarajan, Durairaj Gnanaraj Thomas

Publication date 14 April 2009

zbMATH Keywords

automatacodesconcurrencyPetri net languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 2087213
• scientific article; zbMATH DE number 5201373
• Identification of Petri nets from knowledge of their language
• scientific article; zbMATH DE number 3892612
• A complexity characteristic of Petri net languages

Cited in

(2)

• Learning pomset automata
• Limited codes associated with Petri nets

This page was built for publication: Learning of finite coded Petri net languages

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