1717 search results - page 111 / 344 » A Computable Spectral Theorem |
105
click to vote
CONCUR
1989
Springer
15 years 8 months ago
1989
Springer
In summary, RDL is an intuitionistic temporal logic for the specification of requirements and design of time-dependent systems. Coverage of RDL includes a backward chaining theore...
124
click to vote
CSR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...
122
click to vote
CIE
2008
Springer
15 years 6 months ago
2008
Springer
The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle/ZF, building on a previous mechanization of the reflection theorem. The heavy relia...
166
click to vote
ACS
2011
14 years 11 months ago
2011
We describe an algebra for composing automata in which the actions have probabilities. We illustrate by showing how to calculate the probability of reaching deadlock in k steps in...
141
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...