scientific article; zbMATH DE number 4117879

zbMath0682.68076MaRDI QIDQ4732129

Petr Jančar

Publication date: 1989

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items

Decidability of a temporal logic problem for Petri nets