Sciweavers

19 search results - page 3 / 4
» Fortuna: Model Checking Priced Probabilistic Timed Automata
Sort
View
ATVA
2005
Springer
131views Hardware» more  ATVA 2005»
14 years 1 months ago
An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
Fuzhi Wang, Marta Z. Kwiatkowska
CONCUR
2000
Springer
14 years 19 hour ago
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
ETFA
2008
IEEE
14 years 2 months ago
Reactivity analysis of different Networked Automation System architectures
The reactivity of Networked Automation Systems (NAS) has direct influence on safety and quality aspects. It can be determined by a response time analysis, which itself can be calc...
Jürgen Greifeneder, Georg Frey
ETFA
2006
IEEE
14 years 1 months ago
Optimizing Quality of Control in Networked Automation Systems using Probabilistic Models
New technological trends lead to the increasing use of network technologies in automation. Especially the Ethernet with TCP/IP and wireless networks find growing acceptance. The r...
Jürgen Greifeneder, Georg Frey
ENTCS
2002
139views more  ENTCS 2002»
13 years 7 months ago
Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
Conrado Daws, Marta Z. Kwiatkowska, Gethin Norman