Sciweavers

240 search results - page 3 / 48
» Infinite trace equivalence
Sort
View
FOSSACS
2006
Springer
13 years 9 months ago
On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation
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...
Taolue Chen, Wan Fokkink, Sumit Nain
SOFSEM
1997
Springer
13 years 9 months ago
On Finite Representations of Infinite-State Behaviours
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...
Antonín Kucera
CONCUR
2006
Springer
13 years 9 months ago
On Finite Alphabets and Infinite Bases III: Simulation
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...
Taolue Chen, Wan Fokkink
CSR
2006
Springer
13 years 7 months ago
Weighted Logics for Traces
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...
Ingmar Meinecke