327 search results - page 41 / 66 » Model Checking and Evidence Exploration |
131
click to vote
AAAI
2008
15 years 5 months ago
2008
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...
109
click to vote
JUCS
2006
15 years 3 months ago
2006
Abstract: We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [Itai and Rodeh 1...
108
click to vote
SIGSOFT
2005
ACM
16 years 3 months ago
2005
ACM
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
163
click to vote
DATE
1999
IEEE
15 years 7 months ago
1999
IEEE
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
154
click to vote
HIPC
2007
Springer
15 years 7 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...