Open AccessA Finite Basis for Failure Semantics
Author(s) -
Wan Fokkink,
Sumit Nain
Publication year - 2005
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-27580-0
DOI - 10.1007/11523468_61
Subject(s) - modulo , computer science , semantics (computer science) , alphabet , algebra over a field , basis (linear algebra) , programming language , discrete mathematics , mathematics , pure mathematics , linguistics , geometry , philosophy
We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Groote [12] .
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom