An extension of the inverse method to probabilistic timed automata

Formal Methods in System Design

Volumn 42, Issue 2, 2013, Pages 119-145

  André, Étienne ^a   Fribourg, Laurent ^b   Sproston, Jeremy ^c  

^a UNIVERSITÉ PARIS 13   (France)

^b CNRS   (France)

^c UNIVERSITY OF TURIN   (Italy)

Author keywords

Parametric timed automata; Probabilistic model checking

Indexed keywords

INVERSE PROBLEMS; MAPS; MODEL CHECKING; PROBABILITY;

NON-PROBABILISTIC; PARAMETRIC -ANALYSIS; PARAMETRIC TIMED AUTOMATA; PROBABILISTIC ANALYSIS; PROBABILISTIC MODEL CHECKING; PROBABILISTIC TIMED AUTOMATA; RANDOMIZED PROTOCOLS; TIMING PARAMETERS;

AUTOMATA THEORY;

EID: 84902548241     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10703-012-0169-x     Document Type: Article

References (23)

1. Alur R, Dill DL (1994) A theory of timed automata. Theor Comput Sci 126(2):183-235
2. Alur R, Henzinger TA, Vardi MY (1993) Parametric real-time reasoning. In: Proceedings of the twentyfifth annual ACM symposium on theory of computing, STOC'93. ACM, New York, pp 592-601
3. André É. (2010) An inverse method for the synthesis of timing parameters in concurrent systems. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France
4. André É., Chatain Th, Encrenaz E, Fribourg L (2009) An inverse method for parametric timed automata. Int J Found Comput Sci 20(5):819-836
5. André É., Fribourg L (2010) Behavioral cartography of timed automata. In: Kučera A, Potapov I (eds) Proceedings of the 4th workshop on reachability problems in computational models (RP'10). Lecture notes in computer science, vol 6227. Springer, Berlin, pp 76-90
6. André É., Fribourg L, Kühne U, Soulat R (2012) IMITATOR 2.5: A tool for analyzing robustness in scheduling problems. In: 18th international symposium on formal methods (FM'12). Lecture notes in computer science, vol 7436. Springer, Berlin, pp 33-36
7. André É., Fribourg L, Sproston J (2009) An extension of the inverse method to probabilistic timed automata. In: Roggenbach M (ed) AVoCS'09, electronic communications of the EASST, vol 23. European Association of Software Science and Technology
8. Chamseddine N, Duflot M, Fribourg L, Picaronny C, Sproston J (2008) Computing expected absorption times for parametric determinate probabilistic timed automata. In: Proceedings of the 5th international conference on quantitative evaluation of systems (QEST'08). IEEE Comput Soc, Los Alamitos, pp 254- 263
9. Daws C (2004) Symbolic and parametric model checking of discrete-time Markov chains. In: Proc. ICTAC'04. LNCS, vol 3407. Springer, Berlin, pp 280-294
10. Gregersen H, Jensen HE (1995) Formal design of reliable real time systems.Master's thesis, Department of Mathematics and Computer Science, Aalborg University
11. Han T, Katoen JP, Mereacre A (2008) Approximate parameter synthesis for probabilistic time-bounded reachability. In: Proc. RTSS'08. IEEE Press, New York, pp 173-182
12. Hinton A, Kwiatkowska M, Norman G, Parker D (2006) PRISM: a tool for automatic verification of probabilistic systems. In: TACAS'06, LNCS, vol 3920. Springer, Berlin, pp 441-444
13. Hune T, Romijn J, Stoelinga M, Vaandrager F (2002) Linear parametric model checking of timed automata. J Log Algebr Program 52-53:183-220
14. Kemeny JG, Snell JL, Knapp AW(1976) Denumerable Markov chains, 2nd edn. Graduate texts in mathematics. Springer, Berlin
15. Kwiatkowska M, Norman G, Parker D (2009) Stochastic games for verification of probabilistic timed automata. In: FORMATS'09. LNCS, vol 5813. Springer, Berlin, pp 212-227
16. Kwiatkowska M, Norman G, Parker D, Sproston J (2006) Performance analysis of probabilistic timed automata using digital clocks. Form Methods Syst Des 29:33-78 (Pubitemid 44075773)
17. Kwiatkowska M, Norman G, Segala R, Sproston J (2002) Automatic verification of real-time systems with discrete probability distributions. Theor Comput Sci 282:101-150 (Pubitemid 34715712)
18. Kwiatkowska M, Norman G, Sproston J (2002) Probabilistic model checking of the IEEE 802.11 wireless local area network protocol. In: Proc. PAPM/PROBMIV'02. LNCS, vol 2399. Springer, Berlin, pp 169-187
19. Kwiatkowska M, Norman G, Sproston J (2003) Probabilistic model checking of deadline properties in the IEEE 1394 FireWire root contention protocol. Form Asp Comput 14(3):295-318
20. Kwiatkowska M, Norman G, Sproston J, Wang F (2007) Symbolic model checking for probabilistic timed automata. Inf Comput 205(7):1027-1077 (Pubitemid 46765041)
21. Lanotte R, Maggiolo-Schettini A, Troina A (2007) Parametric probabilistic transition systems for system design and analysis. Form Asp Comput 19(1):93-109 (Pubitemid 46407480)
22. Segala R (1995) Modeling and verification of randomized distributed real-time systems. Ph.D. thesis, Massachusetts Institute of Technology
23. PRISM Web page: Prism web page. http://www.prismmodelchecker.org/