scientific article; zbMATH DE number 4131674

MaRDI QIDQ3033335zbMATH OpenFDO

Authors V. Yu. Kirillov

Publication date 1988

zbMATH Keywords

description of languagesequivalent transformationsfinite automataliveliness conditionsPetri nets

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 controlled finite automata
• Interpreted nets
• scientific article; zbMATH DE number 3843142
• scientific article; zbMATH DE number 3885321
• From Petri nets to automata with concurrency

Cited in

(8)

• Logical representation of algorithmic systems by the Petri-Chomsky machine
• From Petri nets to automata with concurrency
• Petri nets, situations, and automata
• Petri Automata for Kleene Allegories
• A timed Petri net interpreter: An alternative method for simulation
• Interpreted nets
• Petri net controlled finite automata
• Identification of labeled Petri nets from finite automata

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