Sciweavers

2584 search results - page 3 / 517
» On the Forward Checking Algorithm
Sort
View
ATVA
2005
Springer
131views Hardware» more  ATVA 2005»
13 years 10 months ago
An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
Fuzhi Wang, Marta Z. Kwiatkowska
CAV
2005
Springer
104views Hardware» more  CAV 2005»
13 years 10 months ago
Expand, Enlarge and Check... Made Efficient
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
Gilles Geeraerts, Jean-François Raskin, Lau...
AAAI
1993
13 years 6 months ago
Supporting and Optimizing Full Unification in a Forward Chaining Rule System
The Rete and Treat algorithms are considered the most efficient implementation techniques for Forward Chaining rule systems. These algorithms support a language of limited express...
Howard E. Shrobe
CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 5 months ago
Optimal Routing for Decode-and-Forward based Cooperation in Wireless Networks
Abstract- We investigate cooperative wireless relay networks in which the nodes can help each other in data transmission. We study different coding strategies in the single-source ...
Lawrence Ong, Mehul Motani
FMSD
2006
140views more  FMSD 2006»
13 years 5 months ago
Dealing with practical limitations of distributed timed model checking for timed automata
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
Víctor A. Braberman, Alfredo Olivero, Ferna...