2308 search results - page 52 / 462 » Representing Symbolic Reasoning |
177
click to vote
FORMATS
2004
Springer
15 years 11 months ago
2004
Springer
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
165
click to vote
ASPDAC
2007
ACM
15 years 9 months ago
2007
ACM
This paper presents a Boolean based symbolic model checking algorithm for the verification of analog/mixedsignal (AMS) circuits. The systems are modeled in VHDL-AMS, a hardware des...
138
click to vote
FATES
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Classical state-oriented testing approaches are based on simple machine models such as Labelled Transition Systems (LTSs), in which data is represented by concrete values...
126
click to vote
DLT
2003
15 years 6 months ago
2003
We study the random variable Yn representing the number of occurrences of a given symbol in a word of length n generated at random. The stochastic model we assume is a simple non-e...
150
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
In some real world situations, linear models are not sufficient to represent accurately complex relations between input variables and output variables of a studied system. Multila...