scientific article; zbMATH DE number 1884410
From MaRDI portal
Publication:4798030
zbMath1007.68517MaRDI QIDQ4798030
No author found.
Publication date: 18 March 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2165/21650023.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (11)
Comparative branching-time semantics for Markov chains ⋮ HyperPCTL model checking by probabilistic decomposition ⋮ On the use of MTBDDs for performability analysis and verification of stochastic systems. ⋮ Model-checking large structured Markov chains. ⋮ A formal approach to adaptive software: continuous assurance of non-functional requirements ⋮ Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic ⋮ Hypergraph-based parallel computation of passage time densities in large semi-Markov models ⋮ Model checking expected time and expected reward formulae with random time bounds ⋮ Statistical probabilistic model checking with a focus on time-bounded properties ⋮ Compositional Model Checking of product-form CTMCs ⋮ Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
Uses Software
This page was built for publication:
