1717 search results - page 189 / 344 » A Computable Spectral Theorem |
173
click to vote
TPHOL
2008
IEEE
16 years 16 days ago
2008
IEEE
Systems that can immediately react to their inputs may suffer from cyclic dependencies between their actions and the corresponding trigger conditions. For this reason, causality an...
160
click to vote
CIE
2005
Springer
15 years 11 months ago
2005
Springer
L APPROACH TO ABSTRACT ALGEBRA THIERRY COQUAND AND HENRI LOMBARDI Recent work in constructive mathematics show that Hilbert’s program works rge part of abstract algebra. Using in...
153
click to vote
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
We compare the expressive power of two automata-based finite-state models of concurrency. We show that Droste’s and Kuske’s coherent stably concurrent automata and Bednarczyk...
149
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We consider the multiplicative and exponential fragment of linear logic (MELL) and give a Geometry of Interaction (GoI) semantics for it based on unique decomposition categories. ...
166
click to vote
CONCUR
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...