On Finite Bases for Weak Semantics: Failures versus Impossible Futures

Select |




Print


Chen, Taolue; Fokkink, Wan; van Glabbeek, Robert

Chen, Taolue; Fokkink, Wan; van Glabbeek, Robert


2009-01-23


Conference Material


35th Conference on Current Trends in Theory and Practice of Computer Science


Spindleruv Mlyn, Czech Republic


167-180


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.


Springer


Concurrency, Process Algebra, BCCS, labeled transition systems, complete axiomatizations, failures semantics, impossible futures semantics.


http://www.cse.unsw.edu.au/~rvg/pub/weakfailures-ea.pdf


0302-9743


nicta:157


Chen, Taolue; Fokkink, Wan; van Glabbeek, Robert. On Finite Bases for Weak Semantics: Failures versus Impossible Futures. In: M. Nielsen, A. Kucera, P. Bro Miltersen, C. Palamidessi, P. Tuma & F. Valencia Editor, editor/s. 35th Conference on Current Trends in Theory and Practice of Computer Science; Spindleruv Mlyn, Czech Republic. Springer; 2009-01-23. 167-180.



Loading citation data...

Citation counts
(Requires subscription to view)