A Finite Basis for Failure Semantics

13 years 10 months ago

Download www.cs.vu.nl

Abstract. We present a ﬁnite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a ﬁnite alphabet. This solves an open question by Groote [12].

Wan Fokkink, Sumit Nain

Real-time Traffic

ICALP 2005 | Modulo Failure Semantics | Open Question | Theoretical Computer Science | ﬁnite ω-complete Axiomatization |

claim paper

» On Finite Alphabets and Infinite Bases From Ready Pairs to Possible Worlds

» Basic Pattern Matching Calculi a Fresh View on Matching Failure

» More on UnfoldFold Transformations of Normal Programs Preservation of Fittings Semantics

» A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains

» Viewcharts Syntax and Semantics

» Axiomatic FirstOrder Probability

» Rules with Contextually Scoped Negation

» Semantic Web Architecture Stack or Two Towers

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ICALP
Authors	Wan Fokkink, Sumit Nain

Comments (0)

Sciweavers

A Finite Basis for Failure Semantics

ICALP 2005 | Modulo Failure Semantics | Open Question | Theoretical Computer Science | ﬁnite ω-complete Axiomatization |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers