662 search results - page 66 / 133 » Model Checking Procedures for Infinite State Systems |
123
click to vote
ALGORITHMICA
2002
15 years 2 months ago
2002
In this paper we introduce a generalization of Paging to the case where there are many threads of requests. This models situations in which the requests come from more than one ind...
138
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
Business contracts tend to be complex. In current practice, contracts are often designed by hand and adopted by their participants after, at best, a manual analysis. This paper mo...
118
click to vote
ATVA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
170
click to vote
CONCUR
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one pe...
133
click to vote
IANDC
2008
15 years 3 months ago
2008
Hybrid systems are dynamical systems with the ability to describe mixed discretecontinuous evolution of a wide range of systems. Consequently, at first glance, hybrid systems appe...