Skip to main content
Conference Proceedings

On finite bases for weak semantics:Failures versus impossible futures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5404 LNCS 167-180
DOI: 10.1007/978-3-540-95891-8_18
1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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-Verlag Berlin Heidelberg 2009.

Cite

CITATION STYLE

APA

Chen, T., Fokkink, W., & Van Glabbeek, R. (2009). On finite bases for weak semantics:Failures versus impossible futures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5404 LNCS, pp. 167–180). https://doi.org/10.1007/978-3-540-95891-8_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free