788 search results - page 28 / 158 » Symbolic Equivalence Checking |
FORMATS
2004
Springer
14 years 2 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 ...
ADBIS
2001
Springer
14 years 1 months ago
2001
Springer
One potential problem of active database applications is the non-termination of rules. Although algorithms have been proposed to detect non-termination, almost all provide a conser...
COOPIS
2004
IEEE
14 years 17 days ago
2004
IEEE
Abstract. Explicit behavioural interface description languages (BIDLs, protocols) are now recognized as a mandatory feature of component languages in order to address component reu...
RTSS
1995
IEEE
14 years 10 days ago
1995
IEEE
E cient automatic model-checking algorithms for real-time systems have been obtained in recent years based on the state-region graph technique of Alur, Courcoubetis and Dill. Howe...
FMCAD
2004
Springer
14 years 2 months ago
2004
Springer
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...