We prove that the equational theory of the process algebra BCCSP modulo completed simulation equivalence does not have a finite basis. Furthermore, we prove that with a finite alph...
In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns’ notion of weak bisimulation defined over them. We prove that, if we ...
Most declarative SQL-like query languagesfor object-oriented database systems (OOSQL) are orthogonal languages allowing for arbitrary nesting of expressions in the select-, from-,...
Hennie J. Steenhagen, Peter M. G. Apers, Henk M. B...
Abstract. We discuss a pragmatic approach to integrate computer algebra into proof planning. It is based on the idea to separate computation and veri cation and can thereby exploit...
Inheritance is one of the key features in object-oriented design and analysis. It especially supports an incremental development by allowing to stepwise add new functionality to an...