259 search results - page 39 / 52 » Bounded Model Checking for Timed Automata |
75
Voted
ALT
1998
Springer
15 years 3 months ago
1998
Springer
Concept drift means that the concept about which data is obtained may shift from time to time, each time after some minimum permanence. Except for this minimum permanence, the con...
ECOOPW
1999
Springer
15 years 3 months ago
1999
Springer
The model checking of applications of aspects is explained, by showing the stages and proof obligations when a collection of generic aspects (called a superimposition) is combined...
107
click to vote
TACAS
2007
Springer
15 years 5 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
104
click to vote
JCSS
2008
14 years 11 months ago
2008
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
FMCO
2008
Springer
15 years 25 days ago
2008
Springer
In this paper, we present a framework for formal modeling and verification of service-based business processes with focus on their compliance to external regulations such as Segreg...