Sciweavers

483 search results - page 14 / 97
» Linear Ranking with Reachability
Sort
View
ENTCS
2006
125views more  ENTCS 2006»
13 years 8 months ago
Liveness Checking as Safety Checking for Infinite State Spaces
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
Viktor Schuppan, Armin Biere
APWEB
2005
Springer
13 years 10 months ago
A Neural Network Approach to Web Graph Processing
In this paper, we will provide an overview of some of the more recent developments in web graph processing using the classic Google page rank equation as popularized by Brins and P...
Ah Chung Tsoi, Franco Scarselli, Marco Gori, Marku...
CDC
2010
IEEE
134views Control Systems» more  CDC 2010»
13 years 3 months ago
Observer design for Lipschitz systems with discrete-time measurements
In this paper, the authors investigate the problem of designing an observer for Lipschitz nonlinear systems with discrete time measurements (continuous-discrete time systems). The ...
Vincent Andrieu, Madiha Nadri
CORR
2011
Springer
189views Education» more  CORR 2011»
13 years 3 months ago
Analysis of multi-stage open shop processing systems
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
Christian Eggermont, Alexander Schrijver, Gerhard ...