Superposition-based analysis of first-order probabilistic timed automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6397 LNCS, Issue , 2010, Pages 302-316

  Fietzke, Arnaud ^a,b   Hermanns, Holger ^b,c   Weidenbach, Christoph ^a,b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

^c INRIA RHÔNE ALPES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; AUTOMATA THEORY; CALCULATIONS; COMPUTER CIRCUITS; ROBOTS; SEMANTICS; FORMAL LOGIC;

FIRST ORDER LOGIC; FIRST-ORDER FORMULAS; PROBABILISTIC ASPECTS; PROBABILISTIC MODEL CHECKING; PROBABILISTIC TIMED AUTOMATA; SOUND AND COMPLETE; SOUNDNESS AND COMPLETENESS; SUPERPOSITION CALCULUS;

MODEL CHECKING;

EID: 85037522313     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16242-8_22     Document Type: Conference Paper

References (21)

1. Althaus, E., Kruglov, E., Weidenbach, C.: Superposition modulo linear arithmetic SUP(LA). In: Ghilardi, S., Sebastiani, R. (eds.) FroCoS 2009. LNCS, vol. 5749, pp. 84-99. Springer, Heidelberg (2009)
2. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183-235 (1994)
3. Bachmair, L., Ganzinger, H., Waldmann, U.: Refutational theorem proving for hierarchic first-order theories. Applicable Algebra in Engineering, Communication and Computing, AAECC 5(3/4), 193-212 (1994)
4. Bohnenkamp, H.C., D'Argenio, P.R., Hermanns, H., Katoen, J.-P.: MoDeST: A compositional modeling formalism for hard and softly timed systems. IEEE Transactions on Software Engineering 32(10), 812-830 (2006) (Pubitemid 46405593)
5. Droms, R.: Rfc 2131: Dynamic host configuration protocol. In: The Internet Engineering Task Force, IETF (1997), Obsoletes RFC 1541. Status: DRAFT STANDARD
6. Fietzke, A., Hermanns, H., Weidenbach, C.: Superposition-based analysis of firstorder probabilistic timed automata. Reports of SFB/TR 14 AVACS 59, SFB/TR 14 AVACS (2010)
7. Fietzke, A., Weidenbach, C.: Labelled splitting. Ann. Math. Artif. Intell. 55(1-2), 3-34 (2009)
8. Hartmanns, A., Hermanns, H.: A modest approach to checking probabilistic timed automata. In: QEST, pp. 187-196. IEEE Computer Society, Los Alamitos (2009)
9. Hermanns, H.,Wachter, B., Zhang, L.: Probabilistic CEGAR. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 162-175. Springer, Heidelberg (2008)
10. Hoare, C.A.R.: Communicating sequential processes. Commun. ACM 21(8), 666-677 (1978)
11. Kwiatkowska, M., Norman, G., Parker, D.: Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach. International Journal on Software Tools for Technology Transfer (STTT) 6(2), 128-142 (2004)
12. Kwiatkowska, M., Norman, G., Parker, D.: Stochastic games for verification of probabilistic timed automata. In: Ouaknine, J., Vaandrager, F.W. (eds.) FORMATS 2009. LNCS, vol. 5813, pp. 212-227. Springer, Heidelberg (2009)
13. Kwiatkowska, M., Norman, G., Parker, D., Sproston, J.: Performance analysis of probabilistic timed automata using digital clocks. Formal Methods in System Design 29(1), 33-78 (2006) (Pubitemid 44075773)
14. Kwiatkowska, M., Norman, G., Sproston, J.: Probabilistic model checking of deadline properties in the IEEE 1934 FireWire root contention protocol. Formal Aspects of Computing 14(3), 295-318 (2003)
15. Kwiatkowska, M.Z., Norman, G., Sproston, J., Wang, F.: Symbolic model checking for probabilistic timed automata. Information and Computation 205(7), 1027-1077 (2007) (Pubitemid 46765041)
16. Lev-Ami, T., Weidenbach, C., Reps, T.W., Sagiv, M.: Labelled clauses. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 311-327. Springer, Heidelberg (2007)
17. Nonnengart, A.: Hybrid systems verification by location elimination. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 352-365. Springer, Heidelberg (2000)
18. Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, University of Birmingham (2002)
19. Weidenbach, C.: Towards an automatic analysis of security protocols in first-order logic. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol. 1632, pp. 314-328. Springer, Heidelberg (1999)
20. Weidenbach, C.: Combining superposition, sorts and splitting. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 27, vol. 2, pp. 1965-2012. Elsevier, Amsterdam (2001)
21. Weidenbach, C., Dimova, D., Fietzke, A., Kumar, R., Suda, M., Wischnewski, P.: Spass version 3.5. In: Schmidt, R.A. (ed.) Automated Deduction - CADE-22. LNCS, vol. 5663, pp. 140-145. Springer, Heidelberg (2009)