2540 search results - page 124 / 508 » Abstract Logics as Dialgebras |
154
click to vote
FORMATS
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with re...
212
click to vote
FUZZY
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. A handwritten digit recognition system was used in a demonstration project to visualize artificial neural networks, in particular Kohonen’s self-organizing feature map...
146
click to vote
CADE
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. This article introduces two techniques to improve the propagation efficiency of CSP based finite model generation methods. One approach consists in statically rewriting ...
165
click to vote
CADE
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. The little theories method, in which mathematical reasoning is distributed across a network of theories, is a powerful technique for describing and analyzing complex syst...
151
click to vote
CHARME
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. This paper describes a semantic connection between the symbolic trajectory evaluation model-checking algorithm and relational verification in higher-order logic. We prov...