scientific article; zbMATH DE number 1948170
From MaRDI portal
Publication:4411831
zbMath1021.03013MaRDI QIDQ4411831
Danièle Beauquier, Anatol Slissenko, Alexander Rabinovich
Publication date: 10 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2471/24710306.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (7)
When are stochastic transition systems tameable? ⋮ The complexity of synchronizing Markov decision processes ⋮ The well-designed logical robot: learning and experience from observations to the Situation Calculus ⋮ Approximate Verification of the Symbolic Dynamics of Markov Chains ⋮ The probability nesting game ⋮ Bounds for synchronizing Markov decision processes ⋮ Exogenous Probabilistic Computation Tree Logic
This page was built for publication:
