Sciweavers

327 search results - page 41 / 66
» Model Checking and Evidence Exploration
Sort
View
AAAI
2008
14 years 6 days ago
Optimal Metric Planning with State Sets in Automata Representation
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...
Björn Ulrich Borowsky, Stefan Edelkamp
JUCS
2006
124views more  JUCS 2006»
13 years 9 months ago
Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM
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...
Wan Fokkink, Jun Pang
SIGSOFT
2005
ACM
14 years 10 months ago
Lightweight object specification with typestates
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...
Kevin Bierhoff, Jonathan Aldrich
DATE
1999
IEEE
194views Hardware» more  DATE 1999»
14 years 2 months ago
Algorithms for Solving Boolean Satisfiability in Combinational Circuits
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
Luís Guerra e Silva, Luis Miguel Silveira, ...
HIPC
2007
Springer
14 years 1 months ago
Accomplishing Approximate FCFS Fairness Without Queues
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...
K. Subramani, Kamesh Madduri