Sciweavers

1788 search results - page 11 / 358
» Model Theory for Process Algebra
Sort
View
ICECCS
2007
IEEE
125views Hardware» more  ICECCS 2007»
15 years 4 months ago
Achieving Discrete Relative Timing with Untimed Process Algebra
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...
Anton Wijs
LICS
2006
IEEE
15 years 6 months ago
Boolean Algebras for Lambda Calculus
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...
Giulio Manzonetto, Antonino Salibra
95
Voted
CONCUR
2003
Springer
15 years 5 months ago
A Compositional Semantic Theory for Synchronous Component-based Design
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...
Barry Norton, Gerald Lüttgen, Michael Mendler
82
Voted
ENTCS
2006
156views more  ENTCS 2006»
15 years 14 days ago
Computational Effects in Topological Domain Theory
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 ...
Ingo Battenfeld
TCS
2010
14 years 10 months ago
Comparing free algebras in Topological and Classical Domain Theory
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...
Ingo Battenfeld