scientific article; zbMATH DE number 1759620
From MaRDI portal
Publication:4536611
zbMath0999.68145MaRDI QIDQ4536611
Purushothaman Iyer, Parosh Aziz Abdulla, Christel Baier, Bengt Jonsson
Publication date: 25 June 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)
Related Items
Model Checking Probabilistic Systems ⋮ Branching-time model-checking of probabilistic pushdown automata ⋮ Termination Problems in Chemical Kinetics ⋮ Deciding probabilistic bisimilarity over infinite-state probabilistic systems ⋮ Branching-Time Model-Checking of Probabilistic Pushdown Automata ⋮ Quantitative analysis of probabilistic lossy channel systems ⋮ Stochastic Games with Lossy Channels ⋮ Verifying lossy channel systems has nonprimitive recursive complexity.
