Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems

DOI10.1090/crmm/023zbMath1069.68074OpenAlexW1266757872MaRDI QIDQ4821979

No author found.

Publication date: 25 October 2004

Full work available at URL: https://doi.org/10.1090/crmm/023

zbMATH Keywords

verificationMarkov chainsautomatamachine learningnumerical analysisalgebracoinductionprobabilistic systemstream calculus

Mathematics Subject Classification ID

General topics of discrete mathematics in relation to computer science (68R01) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Other algebras related to logic (03G25) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items (19)

Least upper bounds for probability measures and their applications to abstractions ⋮ On the collective sort problem for distributed tuple spaces ⋮ Reachability analysis of uncertain systems using bounded-parameter Markov decision processes ⋮ Model Checking Linear-Time Properties of Probabilistic Systems ⋮ An approach for lifetime reliability analysis using theorem proving ⋮ Bounded Verification of Reachability of Probabilistic Hybrid Systems ⋮ Stability analysis of planar probabilistic piecewise constant derivative systems ⋮ Formal probabilistic analysis of detection properties in wireless sensor networks ⋮ Unnamed Item ⋮ Real-reward testing for probabilistic processes ⋮ Exact quantitative probabilistic model checking through rational search ⋮ Probabilistic model checking of complex biological pathways ⋮ Reasoning about conditional probabilities in a higher-order-logic theorem prover ⋮ Formal reliability analysis of combinational circuits using theorem proving ⋮ Formalization of the standard uniform random variable ⋮ Model-Checking ω-Regular Properties of Interval Markov Chains ⋮ An Inductive Technique for Parameterised Model Checking of Degenerative Distributed Randomised Protocols ⋮ Probabilistic Analysis of Binary Sessions ⋮ Model checking single agent behaviours by fluid approximation

Uses Software

• Rabbit

This page was built for publication: Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems