Sciweavers

7778 search results - page 23 / 1556
» Designing Controllers for Reachability
Sort
View
ETFA
2006
IEEE
14 years 1 months ago
Synthesis of Distributed Controllers by Means of a Monolithic Approach
Abstract. In this paper, reverse partially-marked safe net condition/event systems (RsNCES) are introduced, rules of their functioning are defined and convenient interpretation met...
Dirk Missal, Hans-Michael Hanisch
MINENET
2006
ACM
14 years 1 months ago
Forensic analysis of autonomous system reachability
Security incidents have an adverse impact not only on end systems, but also on Internet routing, resulting in many out-of-reach prefixes. Previous work has looked at performance ...
D. K. Lee, Sue B. Moon, Taesang Choi, Taesoo Jeong
CDC
2009
IEEE
114views Control Systems» more  CDC 2009»
14 years 3 days ago
A computable type theory for control systems
— In this paper, we develop a theory of computable types suitable for the study of control systems. The theory uses type-two effectivity as the underlying computational model, bu...
Pieter Collins
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
12 years 2 months ago
Proving Reachability Using FShell - (Competition Contribution)
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
Andreas Holzer, Daniel Kroening, Christian Schallh...
TACAS
2007
Springer
103views Algorithms» more  TACAS 2007»
14 years 1 months ago
A Reachability Predicate for Analyzing Low-Level Software
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadee...