Characterising Testing Preorders for Finite Probabilistic Processes
From MaRDI portal
Recommendations
Cited in
(54)- Basic observables for processes
- Finite axiom systems for testing preorder and De Simone process languages
- Testing preorders for probabilistic processes can be characterized by simulations
- Testing preorders for probabilistic processes.
- Deterministic concurrent strategies
- Using schedulers to test probabilistic distributed systems
- Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus
- Probabilistic may/must testing: retaining probabilities by restricted schedulers
- The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
- Probabilistic divide \& congruence: branching bisimilarity
- Ensuring liveness properties of distributed systems: open problems
- A probabilistic calculus of cyber-physical systems
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities
- Trace semantics via determinization
- Real-reward testing for probabilistic processes
- A space-efficient simulation algorithm on probabilistic automata
- \textsf{MarCaSPiS}: a Markovian extension of a calculus for services
- Characterising testing preorders for broadcasting distributed systems
- Logical characterizations of behavioral relations on transition systems of probability distributions
- A spectrum of behavioral relations over LTSs on probability distributions
- Semantic analysis of gossip protocols for wireless sensor networks
- Weighted Bisimulation in Linear Algebraic Form
- Testing Finitary Probabilistic Processes
- Trace and testing metrics on nondeterministic probabilistic processes
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- On real reward testing
- scientific article; zbMATH DE number 1760049 (Why is no real title available?)
- Equational reasonings in wireless network gossip protocols
- Termination in convex sets of distributions
- SOS-based modal decomposition on nondeterministic probabilistic processes
- scientific article; zbMATH DE number 1372680 (Why is no real title available?)
- Characterising probabilistic processes logically (extended abstract)
- Discovering ePassport vulnerabilities using bisimilarity
- The sub-additives: a proof theory for probabilistic choice extending linear logic
- Compositional weak metrics for group key update
- scientific article; zbMATH DE number 7204940 (Why is no real title available?)
- Distribution bisimilarity via the power of convex algebras
- Testing preorders for probabilistic processes
- Constructing weak simulations from linear implications for processes with private names
- Graded monads and graded logics for the linear time -- branching time spectrum
- Preface
- Bisimulations respecting duration and causality for the non-interleaving applied \(\pi\)-calculus
- Back to the format: a survey on SOS for probabilistic processes
- Fair must testing for I/O automata
- An equational characterisation of the must testing pre-order for regular processes
- (Towards a) statistical probabilistic lazy lambda calculus
- Model-based testing of probabilistic systems
- Modal algebra of multirelations
- Logical characterization of branching bisimilarity over random processes
- The Kantorovich metric in computer science: a brief survey
- Logical characterization of bisimulation metrics
- A unifying approach to probabilistic testing equivalences
- Raiders of the lost equivalence: probabilistic branching bisimilarity
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
This page was built for publication: Characterising Testing Preorders for Finite Probabilistic Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3623001)
