Abstract / Description of output
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.
Original language | English |
---|---|
Title of host publication | 2007 22nd Annual IEEE Symposium on Logic in Computer Science |
Place of Publication | Los Alamitos, CA, USA |
Publisher | IEEE Computer Society |
Pages | 313-325 |
Number of pages | 13 |
ISBN (Print) | 978-0-7695-2908-0, 0-7695-2908-9 |
DOIs | |
Publication status | Published - 14 Jul 2007 |
Event | The 22nd Annual IEEE Symposium on Logic in Computer Science, 2007 - Wroclaw, Poland Duration: 10 Jul 2007 → 14 Jul 2007 Conference number: 22 |
Publication series
Name | Proceedings of the Annual IEEE Symposium on Logic in Computer Science |
---|---|
Publisher | IEEE |
ISSN (Print) | 1043-6871 |
Symposium
Symposium | The 22nd Annual IEEE Symposium on Logic in Computer Science, 2007 |
---|---|
Abbreviated title | LICS 2007 |
Country/Territory | Poland |
City | Wroclaw |
Period | 10/07/07 → 14/07/07 |
Keywords / Materials (for Non-textual outputs)
- testing
- logic
- calculus
- informatics
- computer science
- australia council