Sciweavers

2299 search results - page 404 / 460
» Logical Data Expiration
Sort
View
FMSD
2006
140views more  FMSD 2006»
14 years 11 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...
IJAIT
2006
136views more  IJAIT 2006»
14 years 11 months ago
Model Checking for Multiagent Systems: the Mable Language and its Applications
We present MABLE, a fully implemented programming language for multiagent systems, which is intended to support the automatic verification of such systems via model checking. In a...
Michael Wooldridge, Marc-Philippe Huget, Michael F...
JUCS
2008
166views more  JUCS 2008»
14 years 11 months ago
ASM Refinement Preserving Invariants
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...
Gerhard Schellhorn
JUCS
2008
160views more  JUCS 2008»
14 years 11 months ago
Automatic Construction of Fuzzy Rule Bases: a further Investigation into two Alternative Inductive Approaches
: The definition of the Fuzzy Rule Base is one of the most important and difficult tasks when designing Fuzzy Systems. This paper discusses the results of two different hybrid meth...
Marcos Evandro Cintra, Heloisa de Arruda Camargo, ...
LISP
2008
96views more  LISP 2008»
14 years 11 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal