2872 search results - page 262 / 575 » On (Omega-)Regular Model Checking |
153
click to vote
FUIN
2000
15 years 4 months ago
2000
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
130
click to vote
ICPP
1993
IEEE
15 years 8 months ago
1993
IEEE
: Events are occurrence instances of actions. The thesis of this paper is that the use of “actions”, instead of events, greatly simplifies the problem of concurrent debugging....
117
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...
166
click to vote
ICSE
2004
IEEE-ACM
16 years 4 months ago
2004
IEEE-ACM
Model checking is an automated technique that can be used to determine whether a system satisfies certain required properties. To address the "state explosion" problem a...
188
click to vote
CONCUR
2009
Springer
15 years 11 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...