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...
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...
: 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...
: 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, ...
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...