1788 search results - page 11 / 358 » Model Theory for Process Algebra |
ICECCS
2007
IEEE
13 years 11 months ago
2007
IEEE
For many systems, timing aspects are essential. Therefore, when modelling these systems, time should somehow be represented. In the past, many timed process algebras have been dev...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
CONCUR
2003
Springer
14 years 19 days ago
2003
Springer
Abstract. Digital signal processing and control (DSPC) tools allow application developers to assemble systems by connecting predefined components in signal–flow graphs and by h...
ENTCS
2006
13 years 7 months ago
2006
This paper contributes towards establishing the category QCB, of topological quotients of countably based spaces, and its subcategory TP, of topological predomains, as a flexible ...
TCS
2010
13 years 5 months ago
2010
We compare how computational effects are modelled in Classical Domain Theory and Topological Domain Theory. Both of these theories provide powerful toolkits for denotational sema...