Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus

DOI10.1007/s00165-012-0238-3zbMath1259.68143arXiv1201.2258MaRDI QIDQ1941882

Alwen Tiu, Yu-xin Deng

Publication date: 22 March 2013

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.2258

zbMATH Keywords

modal logic; bisimulation; testing semantics; probabilistic {\(\pi\)}-calculus

Mathematics Subject Classification ID

03B45: Modal logic (including the logic of norms)

03B70: Logic in computer science

68Q55: Semantics in the theory of computing

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Late and early semantics coincide for testing
• Bisimulation for higher-order process calculi
• Modal logics for mobile processes
• A calculus of mobile processes. II
• Testing equivalences for processes
• Reactive, generative, and stratified models of probabilistic processes
• Testing equivalence for mobile processes
• A framework for analyzing probabilistic protocols and its application to the partial secrets exchange
• Remarks on Testing Probabilistic Processes
• Testing Finitary Probabilistic Processes
• A testing scenario for probabilistic processes
• Characterising Testing Preorders for Finite Probabilistic Processes
• On the bisimulation proof method
• Branching time and abstraction in bisimulation semantics
• Scalar Outcomes Suffice for Finitary Probabilistic Testing
• Logical Characterizations of Bisimulations for Discrete Probabilistic Systems