Determining asynchronous test equivalence for probabilistic processes

DOI10.1016/j.ipl.2022.106269OpenAlexW4220714506MaRDI QIDQ2671816

Puneet Bhateja

Publication date: 3 June 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106269

zbMATH Keywords

formal semanticsdecidabilityprobabilistic processasynchronous test behaviour

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation through probabilistic testing
• Testing equivalences for processes
• Testing preorders for probabilistic processes.
• Trace and testing equivalence on asynchronous processes
• Reactive, generative, and stratified models of probabilistic processes
• The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
• Alternative characterizations of probabilistic trace equivalences on coherent resolutions of nondeterminism
• A Fresh Look at Testing for Asynchronous Communication
• A testing scenario for probabilistic processes
• Formal verification of parallel programs
• Communicating sequential processes
• Validation of Stochastic Systems
• Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
• Testing probabilistic automata

This page was built for publication: Determining asynchronous test equivalence for probabilistic processes