scientific article; zbMATH DE number 1512704

zbMath0963.68072MaRDI QIDQ4508393

Richard Mayr

Publication date: 3 October 2000

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

zbMATH Keywords

reset Petri netslossy counter machines

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

The decision problem of modal product logics with a diagonal, and faulty counter machines ⋮ Handling infinitely branching well-structured transition systems ⋮ Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting ⋮ Automatic verification of recursive procedures with one integer parameter. ⋮ A classification of the expressive power of well-structured transition systems ⋮ Verifying lossy channel systems has nonprimitive recursive complexity.