Measuring the confinement of probabilistic systems

DOI10.1016/j.tcs.2005.03.002zbMath1142.68444OpenAlexW2157153384MaRDI QIDQ557887

Herbert Wiklicky, Alessandra Di Pierro, Chris Hankin

Publication date: 30 June 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.002

zbMATH Keywords

Security analysisProbabilistic bisimulationProbabilistic weak bisimulationStatic program analysisStatistical testing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Combinatorial probability (60C05) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Probabilistic Analysis of Programs: A Weak Limit Approach, Semantics of Probabilistic Programs: A Weak Limit Approach, Relational Analysis and Precision via Probabilistic Abstract Interpretation, Probabilistic Semantics and Program Analysis, Anonymity protocols as noisy channels, Payoffs, Intensionality and Abstraction in Games, Long-run cost analysis by approximation of linear operators over dioids, Anonymity Protocols as Noisy Channels, Tempus fugit: How to plug it, On Probabilistic Techniques for Data Flow Analysis

Uses Software

• PRISM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• A calculus of communicating systems
• Bisimulation through probabilistic testing
• Introduction to large truncated Toeplitz matrices
• Testing equivalences for processes
• Reactive, generative, and stratified models of probabilistic processes
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Bisimulation for labelled Markov processes
• The operator theory of the pseudo-inverse. I: Bounded operators, II: Unbounded operators with arbitrary range
• A Survey on Spectra of infinite Graphs
• Finite Continuous Time Markov Chains
• The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
• Abstract interpretation and application to logic programs
• Probabilistic Confinement in a Declarative Framework
• Random Walks on Infinite Graphs and Groups
• Testing preorders for probabilistic processes
• CONCUR 2003 - Concurrency Theory
• \(C^*\)-algebras by example
• Best approximation in inner product spaces
• Handbook of Markov decision processes. Methods and applications