Sciweavers

53 search results - page 9 / 11
» Bounded Model Checking for Region Automata
Sort
View
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
15 years 3 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre
RTSS
2008
IEEE
15 years 3 months ago
Schedulability and Compatibility of Real Time Asynchronous Objects
Abstract—We apply automata theory to specifying behavioral interfaces of objects and show how to check schedulability and compatibility of real time asynchronous objects. The beh...
Mohammad Mahdi Jaghoori, Delphine Longuet, Frank S...
ISTCS
1992
Springer
15 years 29 days ago
Concurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
Rainer Gawlick, Nancy A. Lynch, Nir Shavit
FOSSACS
2007
Springer
15 years 3 months ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong
CORR
2009
Springer
242views Education» more  CORR 2009»
14 years 7 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...