Characterising Testing Preorders for Finite Probabilistic Processes

Wroclaw, Poland July 10-July 14

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/LICS.2007.15

22nd Annual IEEE Symposium on Logic i ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Yuxin Deng Articles by Rob van Glabbeek Articles by Matthew Hennessy Articles by Carroll Morgan Articles by Chenyi Zhang

	ASCII Text	x
	Yuxin Deng, Rob van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang, "Characterising Testing Preorders for Finite Probabilistic Processes," Logic in Computer Science, Symposium on, pp. 313-325, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007.

	BibTex	x
	@article{ 10.1109/LICS.2007.15, author = {Yuxin Deng and Rob van Glabbeek and Matthew Hennessy and Carroll Morgan and Chenyi Zhang}, title = {Characterising Testing Preorders for Finite Probabilistic Processes}, journal ={Logic in Computer Science, Symposium on}, volume = {0}, year = {2007}, issn = {1043-6871}, pages = {313-325}, doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2007.15}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Logic in Computer Science, Symposium on TI - Characterising Testing Preorders for Finite Probabilistic Processes SN - 1043-6871 SP313 EP325 A1 - Yuxin Deng, A1 - Rob van Glabbeek, A1 - Matthew Hennessy, A1 - Carroll Morgan, A1 - Chenyi Zhang, PY - 2007 KW - null VL - 0 JA - Logic in Computer Science, Symposium on ER -

Yuxin Deng, Jiao tong University, China; University of New South Wales, Australia

Rob van Glabbeek, National ICT Australia; University of New South Wales, Australia

Matthew Hennessy, University of Sussex, UK

Carroll Morgan, University of New South Wales, Australia

Chenyi Zhang, National ICT Australia; University of New South Wales, Australia

In 1992 Wang & Larsen extended the may- and must preorders of De Nicola and Hennessy to processes featuring probabilistic as well as nondeterministic choice. They concluded with two problems that have remained open throughout the years, namely to find complete axiomatisations and alternative characterisations for these preorders. This paper solves both problems for finite processes with silent moves. It characterises the may preorder in terms of simulation, and the must preorder in terms of failure simulation. It also gives a characterisation of both preorders using a modal logic. Finally it axiomatises both preorders over a probabilistic version of CSP.

Citation:

Yuxin Deng, Rob van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang, "Characterising Testing Preorders for Finite Probabilistic Processes," lics, pp.313-325, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.