Sciweavers

231 search results - page 14 / 47
» Improvements to combinational equivalence checking
Sort
View
ATAL
1997
Springer
14 years 6 days ago
Approximate Reasoning about Combined Knowledge
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
Frédéric Koriche
ENTCS
2007
137views more  ENTCS 2007»
13 years 8 months ago
Formal Sequentialization of Distributed Systems via Program Rewriting
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
Miquel Bertran, Francesc-Xavier Babot, August Clim...
FMICS
2008
Springer
13 years 9 months ago
Efficient Symbolic Model Checking for Process Algebras
Different approaches have been developed to mitigate the state space explosion of model checking techniques. Among them, symbolic verification techniques use efficient representati...
José Vander Meulen, Charles Pecheur
DAC
2001
ACM
14 years 9 months ago
Circuit-based Boolean Reasoning
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuit...
Andreas Kuehlmann, Malay K. Ganai, Viresh Paruthi
FORMATS
2007
Springer
14 years 2 months ago
Hypervolume Approximation in Timed Automata Model Checking
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
Víctor A. Braberman, Jorge Lucángeli...