Abstract / Description of output
We provide a finite basis for the (in)equational theory of the process algebra BCCS modulo the weak failures preorder and equivalence. We also give positive and negative results regarding the axiomatizability of BCCS modulo weak impossible futures semantics.
Original language | English |
---|---|
Title of host publication | SOFSEM 2009: Theory and Practice of Computer Science: 35th Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings |
Editors | Mogens Nielsen, Antonín Kučera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma, Frank Valencia |
Place of Publication | Berlin, Heidelberg |
Publisher | Springer |
Pages | 167-180 |
Number of pages | 14 |
ISBN (Electronic) | 978-3-540-95891-8 |
ISBN (Print) | 978-3-540-95890-1 |
DOIs | |
Publication status | Published - 30 Jan 2009 |
Event | The 35th International Conference on Current Trends in Theory and Practice of Computer Science - Špindleruv Mlýn, Czech Republic Duration: 24 Jan 2009 → 30 Jan 2009 Conference number: 35 http://www.sofsem.cz/sofsem09/index.php |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer Berlin, Heidelberg |
Volume | 5404 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | The 35th International Conference on Current Trends in Theory and Practice of Computer Science |
---|---|
Abbreviated title | SOFSEM 2009 |
Country/Territory | Czech Republic |
City | Špindleruv Mlýn |
Period | 24/01/09 → 30/01/09 |
Internet address |