NDLI: Characterisations of testing preorders for a finite probabilistic π-calculus

Content Provider	Springer Nature Link
Author	Deng, Yuxin Tiu, Alwen
Copyright Year	2012
Abstract	We consider two characterisations of the may and must testing preorders for a probabilistic extension of the finite π-calculus: one based on notions of probabilistic weak simulations, and the other on a probabilistic extension of a fragment of Milner–Parrow–Walker modal logic for the π-calculus. We base our notions of simulations on similar concepts used in previous work for probabilistic CSP. However, unlike the case with CSP (or other non-value-passing calculi), there are several possible definitions of simulation for the probabilistic π-calculus, which arise from different ways of scoping the name quantification. We show that in order to capture the testing preorders, one needs to use the “earliest” simulation relation (in analogy to the notion of early (bi)simulation in the non-probabilistic case). The key ideas in both characterisations are the notion of a “characteristic formula” of a probabilistic process, and the notion of a “characteristic test” for a formula. As in an earlier work on testing equivalence for the π-calculus by Boreale and De Nicola, we extend the language of the π-calculus with a mismatch operator, without which the formulation of a characteristic test will not be possible.
Starting Page	701
Ending Page	726
Page Count	26
File Format	PDF
ISSN	09345043
Journal	Formal Aspects of Computing
Volume Number	24
Issue Number	4-6
e-ISSN	1433299X
Language	English
Publisher	Springer-Verlag
Publisher Date	2012-06-29
Publisher Place	London
Access Restriction	Subscribed
Subject Keyword	Probabilistic π-calculus Testing semantics Bisimulation Modal logic Computational Mathematics and Numerical Analysis Theory of Computation Math Applications in Computer Science
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Probabilistic Duration Calculus for Continuous Time

Deciding probabilistic automata weak bisimulation: theory and practice

Exploring probabilistic bisimulations, part I

A Calculus and logic of resources and processes

A compositional Petri net translation of general π-calculus terms

Characterisations of Testing Preorders for a Finite Probabilistic pi-Calculus

Refinement in hybridised institutions

Deciding orthogonal bisimulation

Duration calculus: Logical foundations

Characterisations of testing preorders for a finite probabilistic π-calculus

Similar Documents

Probabilistic Duration Calculus for Continuous Time

Deciding probabilistic automata weak bisimulation: theory and practice

Exploring probabilistic bisimulations, part I

A Calculus and logic of resources and processes

A compositional Petri net translation of general π-calculus terms

Characterisations of Testing Preorders for a Finite Probabilistic pi-Calculus

Refinement in hybridised institutions

Deciding orthogonal bisimulation

Duration calculus: Logical foundations

Characterisations of testing preorders for a finite probabilistic π-calculus