23 search results - page 2 / 5 » fossacs 2006 |
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
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...
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on words. Stirling (1996, 1998) proved the de...
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languag...
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
We take the point of view that, if transition systems are coalgebras for a functor T, then an adequate logic for these transition systems should arise from the `Stone dual' L ...
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove tha...