Sciweavers

622 search results - page 49 / 125
» Answer Set Programming and Bounded Model Checking
Sort
View
FMCAD
2000
Springer
13 years 11 months ago
The Semantics of Verilog Using Transition System Combinators
Abstract. Since the advent of model checking it is becoming more common for languages to be given a semantics in terms of transition systems. Such semantics allow to model check pr...
Gordon J. Pace
KI
2011
Springer
13 years 3 months ago
Centurio, a General Game Player: Parallel, Java- and ASP-based
Abstract We present the General Game Playing system Centurio. Centurio is a Java-based player featuring different strategies based on Monte Carlo Tree Search extended by technique...
Maximilian Möller, Marius Thomas Schneider, M...
RTCSA
2009
IEEE
14 years 2 months ago
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
CSL
2006
Springer
13 years 11 months ago
Game Quantification on Automatic Structures and Hierarchical Model Checking Games
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
Lukasz Kaiser
VMCAI
2010
Springer
14 years 5 months ago
Best Probabilistic Transformers
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...
Björn Wachter, Lijun Zhang