Algebraic theory of probabilistic processes.

DOI10.1016/S1567-8326(02)00069-3zbMATH Open1048.68057MaRDI QIDQ1400293FDOQ1400293

Authors: Manuel Núñez 

Publication date: 13 August 2003

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Recommendations

• Remarks on testing probabilistic processes
• Testing preorders for probabilistic processes.
• scientific article; zbMATH DE number 7311343
• A testing scenario for probabilistic processes
• scientific article; zbMATH DE number 1231682

zbMATH Keywords

Probabilistic process algebrasProbabilistic testing semantics

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)
• Bisimulation through probabilistic testing
• A logic for reasoning about time and reliability
• Title not available (Why is that?)
• Testing equivalences for processes
• Handbook of process algebra
• Reactive, generative, and stratified models of probabilistic processes
• Axiomatizing probabilistic processes: ACP with generative probabilities
• Testing preorders for probabilistic processes.
• Title not available (Why is that?)
• Title not available (Why is that?)
• A process algebra for probabilistic and nondeterministic processes
• Acceptance trees
• Title not available (Why is that?)
• Testing probabilistic automata
• Probabilistic and prioritized models of timed CSP
• Priority in process algebra.
• Probabilistic extensions of process algebras.
• Composition and behaviors of probabilistic I/O automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (25)

• Algebraic theory of probabilistic and nondeterministic processes.
• Title not available (Why is that?)
• Retaining the probabilities in probabilistic testing theory
• A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets
• \(\pi\)-calculus with noisy channels
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• Using schedulers to test probabilistic distributed systems
• Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language
• Non-bisimulation-based Markovian behavioral equivalences
• A model of probabilistic processes
• Title not available (Why is that?)
• A testing scenario for probabilistic processes
• Remarks on testing probabilistic processes
• Formalisation of Probabilistic Testing Semantics in Coq
• An extended framework for passive asynchronous testing
• Title not available (Why is that?)
• Validation of Stochastic Systems
• Probabilistic barbed congruence
• Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems
• Title not available (Why is that?)
• Testing from a stochastic timed system with a fault model
• Markovian testing and trace equivalences exactly lump more than Markovian bisimilarity
• Title not available (Why is that?)
• Denotational semantics for a probabilistic timed shared-variable language
• Specification, testing and implementation relations for symbolic-probabilistic systems

This page was built for publication: Algebraic theory of probabilistic processes.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400293)