360 search results - page 19 / 72 » Hybrid Branching-Time Logics |
ISIPTA
2005
IEEE
15 years 3 months ago
2005
IEEE
Possibilistic networks and possibilistic logic bases are important tools to deal with uncertain pieces of information. Both of them offer a compact representation of possibility ...
104
click to vote
JELIA
1994
Springer
15 years 1 months ago
1994
Springer
: In this paper we describe a general way of formalizing reasoning behaviour. Such a behaviour may be described by all the patterns which are valid for the behaviour. A pattern can...
FAC
2000
14 years 9 months ago
2000
Typically, program design involves constructing a program P that implements a given specification S; that is, the set P of executions of P is a subset of the set S of executions s...
118
click to vote
FORTE
2009
14 years 7 months ago
2009
We present a strategy for model-checking the correctness of service composition. We do so in the context of SRML, a formal modelling framework for service-oriented computing being ...
HYBRID
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...