scientific article; zbMATH DE number 4117879

MaRDI QIDQ4732129zbMATH OpenFDO

Authors Petr Jančar

Publication date 1989

Full work available at URL https://eudml.org/doc/17727

zbMATH Keywords

boundedness(strongly) fair firing sequenceinfinite weakly fair firing sequencethe decidability

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 4024804
• Decidability of weak fairness in Petri nets
• Entscheidbarkeit bei Petri Netzen
• Decidability of the Petri net reachability problem
• scientific article; zbMATH DE number 559221

Cited in

(5)

• Decidability of a temporal logic problem for Petri nets
• Decidability of weak fairness in Petri nets
• scientific article; zbMATH DE number 4024804 (Why is no real title available?)
• Entscheidbarkeit bei Petri Netzen
• scientific article; zbMATH DE number 4115984 (Why is no real title available?)

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