612 search results - page 10 / 123 » Bounded model checking for knowledge and real time |
FMSD
2006
14 years 9 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
110
Voted
ERSHOV
2006
Springer
14 years 11 months ago
2006
Springer
Abstract. We address model checking problem for combination of Computation Tree Logic (CTL) and Propositional Logic of Knowledge (PLK) in finite systems with the perfect recall syn...
CAV
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search fo...
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper presents general techniques for formally modeling, simulating, and model checking real-time resource-sharing protocols in Real-Time Maude. The “scheduling subset” o...
207
click to vote
RTAS
2011
IEEE
14 years 1 months ago
2011
IEEE
—In this paper, we propose two adaptive scheduling approaches to support real-time control applications with highly varying computation times. The use of a resource reservation s...