On Finite Bases for Weak Semantics: Failures Versus Impossible Futures

Taolue Chen, Wan Fokkink, Rob van Glabbeek

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.
Original languageEnglish
Title of host publicationSOFSEM 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
EditorsMogens Nielsen, Antonín Kučera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma, Frank Valencia
Place of PublicationBerlin, Heidelberg
PublisherSpringer Berlin Heidelberg
Pages167-180
Number of pages14
ISBN (Electronic)978-3-540-95891-8
ISBN (Print)978-3-540-95890-1
DOIs
Publication statusPublished - 30 Jan 2009
EventThe 35th International Conference on Current Trends in Theory and Practice of Computer Science - Špindleruv Mlýn, Czech Republic
Duration: 24 Jan 200930 Jan 2009
Conference number: 35
http://www.sofsem.cz/sofsem09/index.php

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin, Heidelberg
Volume5404
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceThe 35th International Conference on Current Trends in Theory and Practice of Computer Science
Abbreviated titleSOFSEM 2009
Country/TerritoryCzech Republic
CityŠpindleruv Mlýn
Period24/01/0930/01/09
Internet address

Fingerprint

Dive into the research topics of 'On Finite Bases for Weak Semantics: Failures Versus Impossible Futures'. Together they form a unique fingerprint.

Cite this