On Finite Bases for Weak Semantics: Failures versus Impossible Futures

Details On Finite Bases for Weak Semantics: Failures versus Impossible Futures On Finite Bases for Weak Semantics: Failures versus Impossible Futures

2008-10-27

arxiv.org/abs/0810.4904v1

Computer Science

Logic in Computer Science

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Finite Bases for Weak Semantics: Failures versus Impossible Futures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Finite Bases for Weak Semantics: Failures versus Impossible Futures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Finite Bases for Weak Semantics: Failures versus Impossible Futures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-324708