scientific article; zbMATH DE number 2087806
From MaRDI portal
Publication:4738778
zbMath1047.68533MaRDI QIDQ4738778
No author found.
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2324/23240200.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives ⋮ Models of transcription factor binding: sensitivity of activation functions to model assumptions ⋮ Scenario-Based Verification of Uncertain MDPs ⋮ Deciding probabilistic automata weak bisimulation: theory and practice ⋮ Model checking and abstraction to the aid of parameterized systems (a survey) ⋮ Symbolic model checking for probabilistic timed automata ⋮ Binary Decision Diagrams ⋮ Command-based importance sampling for statistical model checking ⋮ Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms ⋮ Performance limits and trade-offs in entropy-driven biochemical computers ⋮ Limited by sensing -- a minimal stochastic model of the lag-phase during diauxic growth ⋮ Modular verification of protocol equivalence in the presence of randomness ⋮ A Tutorial on Interactive Markov Chains ⋮ Formal techniques for performance analysis: blending SAN and PEPA ⋮ ExplicitPRISMSymm: Symmetry Reduction Technique for Explicit Models in PRISM ⋮ On the use of MTBDDs for performability analysis and verification of stochastic systems. ⋮ Space-efficient scheduling of stochastically generated tasks ⋮ Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions ⋮ Reconciling real and stochastic time: the need for probabilistic refinement ⋮ Unnamed Item ⋮ Formal probabilistic analysis of detection properties in wireless sensor networks ⋮ Formal modelling and verification of probabilistic resource bounded agents ⋮ SySCoRe: Synthesis via Stochastic Coupling Relations ⋮ Wordgen : a Timed word Generation Tool ⋮ Comparative Analysis of Statistical Model Checking Tools ⋮ Modeling tripartite entanglement in quantum protocols using evolving entangled hypergraphs ⋮ Modeling fimbriae mediated parasite-host interactions ⋮ Unnamed Item ⋮ Using probabilistic Kleene algebra pKA for protocol verification ⋮ Maximizing the Conditional Expected Reward for Reaching the Goal ⋮ Analysing distributed internet worm attacks using continuous state-space approximation of process algebra models ⋮ Safe autonomy under perception uncertainty using chance-constrained temporal logic ⋮ Model-based testing of probabilistic systems ⋮ Preface to the special issue on probabilistic model checking ⋮ Probabilistic approximations of ODEs based bio-pathway dynamics ⋮ Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives ⋮ Evaluating Complex MAC Protocols for Sensor Networks with APMC ⋮ Measuring the confinement of probabilistic systems ⋮ Model checking expected time and expected reward formulae with random time bounds ⋮ Faster statistical model checking for unbounded temporal properties ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Temporalization of Probabilistic Propositional Logic ⋮ Mixing logics and rewards for the component-oriented specification of performance measures ⋮ Verification of Context-Dependent Channel-Based Service Models ⋮ Nearly Optimal Verifiable Data Streaming ⋮ Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus ⋮ Natural strategic ability ⋮ Model Checking-Based Genetic Programming with an Application to Mutual Exclusion ⋮ PRISM ⋮ Unnamed Item ⋮ Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates ⋮ Probabilistic model checking of biological systems with uncertain kinetic rates ⋮ Quantitative Analysis under Fairness Constraints ⋮ Multi-valued Verification of Strategic Ability ⋮ An elementary proof that Herman's ring is \(\Theta (N^{2})\) ⋮ Probabilistic guarded commands mechanized in HOL ⋮ Automated verification and synthesis of stochastic hybrid systems: a survey ⋮ Weak Probabilistic Anonymity ⋮ Simulation of Generalised Semi-Markov Processes based on Graph Transformation Systems ⋮ PEPA Queues: Capturing Customer Behaviour in Queueing Networks ⋮ Exogenous Probabilistic Computation Tree Logic ⋮ Optimal cost almost-sure reachability in POMDPs
Uses Software