240 search results - page 3 / 48 » Infinite trace equivalence |
ENTCS
2010
13 years 8 months ago
2010
FOSSACS
2006
Springer
14 years 10 days 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...
SOFSEM
1997
Springer
14 years 7 days ago
1997
Springer
Abstract. We examine the problem of finite-state representability of infinitestate processes w.r.t. certain behavioural equivalences. We show that the classical notion of regularit...
CONCUR
2006
Springer
14 years 12 days ago
2006
Springer
This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least...
CSR
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. We study a quantitative model of traces, i.e. trace series which assign to every trace an element from a semiring. We show the coincidence of recognizable trace series wi...