Sciweavers

296 search results - page 1 / 60
» Linear Parametric Model Checking of Timed Automata
Sort
View
ENTCS
2007
156views more  ENTCS 2007»
13 years 3 months ago
Bounded Model Checking with Parametric Data Structures
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
Erika Ábrahám, Marc Herbstritt, Bern...
TACAS
2001
Springer
111views Algorithms» more  TACAS 2001»
13 years 8 months ago
Linear Parametric Model Checking of Timed Automata
Thomas Hune, Judi Romijn, Mariëlle Stoelinga,...
FORMATS
2006
Springer
13 years 7 months ago
Verification of the Generic Architecture of a Memory Circuit Using Parametric Timed Automata
Using a variant of Clariso-Cortadella's parametric method for verifying asynchronous circuits, we formally derive a set of linear constraints that ensure the correctness of so...
Remy Chevallier, Emmanuelle Encrenaz-Tiphèn...
RTSS
2008
IEEE
13 years 10 months ago
Symbolic Computation of Schedulability Regions Using Parametric Timed Automata
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...
Alessandro Cimatti, Luigi Palopoli, Yusi Ramadian
FOSSACS
2011
Springer
12 years 7 months ago
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
Naoki Kobayashi