Sciweavers

697 search results - page 4 / 140
» Implementation of Timed Automata: An Issue of Semantics or M...
Sort
View
TC
2008
13 years 7 months ago
Implementing Synchronous Models on Loosely Time Triggered Architectures
Synchronous systems offer clean semantics and an easy verification path at the expense of often inefficient implementations. Capturing design specifications as synchronous models a...
Stavros Tripakis, Claudio Pinello, Albert Benvenis...
FORMATS
2007
Springer
13 years 11 months ago
Partial Order Reduction for Verification of Real-Time Components
Abstract. We describe a partial order reduction technique for a realtime component model. Components are described as timed automata with data ports, which can be composed in stati...
John Håkansson, Paul Pettersson
SCP
2010
174views more  SCP 2010»
13 years 2 months ago
Aspects of availability: Enforcing timed properties to prevent denial of service
We propose a domain-specific aspect language to prevent denial of service caused by resource management. Our aspects specify availability policies by enforcing time limits in the ...
Pascal Fradet, Stéphane Hong Tuan Ha
QEST
2008
IEEE
14 years 1 months ago
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye...
FM
2001
Springer
108views Formal Methods» more  FM 2001»
13 years 12 months ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer