1138 search results - page 101 / 228 » First-Order Model Checking Problems Parameterized by the Mod... |
113
Voted
AMC
2008
15 years 2 months ago
2008
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
110
Voted
TSMC
2002
15 years 2 months ago
2002
Automata models of learning systems introduced in the 1960s were popularized as learning automata (LA) in a survey paper in 1974 [1]. Since then, there have been many fundamental a...
105
Voted
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
126
Voted
CONCUR
2000
Springer
15 years 7 months ago
2000
Springer
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
127
click to vote
ICFEM
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...