294 search results - page 33 / 59 » Formal Verification of the Implementability of Timing Requir... |
DATE
2008
IEEE
14 years 3 months ago
2008
IEEE
Property checking is a promising approach to prove the correctness of today’s complex designs. However, in practice this requires the formulation of formal properties which is a...
QEST
2010
IEEE
13 years 6 months ago
2010
IEEE
Discrete-Time Markov Chains (DTMCs) are a widely-used formalism to model probabilistic systems. On the one hand, available tools like PRISM or MRMC offer efficient model checking a...
ISSTA
2000
ACM
14 years 26 days ago
2000
ACM
This paper presents three sets of classification schemes for processes, properties, and transitions that can be used to assist in the analysis of real-time systems. These classifi...
CONCUR
2012
Springer
11 years 11 months ago
2012
Springer
Networks of timed automata (NTA) are widely used to model distributed real-time systems. Quite often in the literature, the automata are allowed to share clocks. This is a problem ...
FM
2001
Springer
14 years 29 days ago
2001
Springer
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...