Sciweavers

Share
7 search results - page 1 / 2
» Durations and parametric model-checking in timed automata
Sort
View
ENTCS
2007
156views more  ENTCS 2007»
9 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»
9 years 8 months ago
Linear Parametric Model Checking of Timed Automata
Thomas Hune, Judi Romijn, Mariëlle Stoelinga,...
TOCL
2008
52views more  TOCL 2008»
9 years 3 months ago
Durations and parametric model-checking in timed automata
Véronique Bruyère, Emmanuel Dall'Oli...
ENTCS
2002
91views more  ENTCS 2002»
9 years 3 months ago
Interval Duration Logic: Expressiveness and Decidability
We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Du...
Paritosh K. Pandya
RTSS
2008
IEEE
9 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
books