Sciweavers

26 search results - page 2 / 6
» Reducing Context-Bounded Concurrent Reachability to Sequenti...
Sort
View
COMPSAC
2005
IEEE
13 years 10 months ago
Designing Controllers for Reachability
We propose a deductive method for constructing reliable reachability controllers, with application to fault-tolerant discrete systems. Designing the controller reduces to finding...
Cristina Cerschi Seceleanu
FMCAD
2004
Springer
13 years 10 months ago
Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
Mohammad Awedh, Fabio Somenzi
AAAI
2008
13 years 6 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor
SAS
2012
Springer
208views Formal Methods» more  SAS 2012»
11 years 7 months ago
Finding Non-terminating Executions in Distributed Asynchronous Programs
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
Michael Emmi, Akash Lal
IROS
2009
IEEE
120views Robotics» more  IROS 2009»
13 years 11 months ago
Concurrent tree traversals for improved mission performance under limited communication range
— In previous work we presented a multi-robot strategy for routing missions in large scenarios where network connectivity must be explicitly preserved. This strategy is founded o...
Alejandro R. Mosteo, Luis Montano