-
1
-
-
38049096324
-
Computational approaches to reachability analysis of stochastic hybrid systems
-
In Bemporad A, Bicchi A, Buttazzo G, editors, in Lecture Notes in Computer Sciences, Springer-Verlag, Berlin
-
Abate A, Amin S, Prandini M, Lygeros J, Sastry S. Computational approaches to reachability analysis of stochastic hybrid systems. In Bemporad A, Bicchi A, Buttazzo G, editors, Hybrid Systems: Computation and Control, number 4416 in Lecture Notes in Computer Sciences, pages 4-17. Springer-Verlag, Berlin, 2007.
-
(2007)
Hybrid Systems: Computation and Control
, Issue.4416
, pp. 4-17
-
-
Abate, A.1
Amin, S.2
Prandini, M.3
Lygeros, J.4
Sastry, S.5
-
2
-
-
52349103145
-
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
-
Abate A, Prandini M, Lygeros J, Sastry S. Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems. Automatica 44(11): 2724-2734, 2008.
-
(2008)
Automatica
, vol.44
, Issue.11
, pp. 2724-2734
-
-
Abate, A.1
Prandini, M.2
Lygeros, J.3
Sastry, S.4
-
3
-
-
0029637354
-
The algorithmic analysis of hybrid systems
-
Alur R, Courcoubetis C, Halbawachs N, Henzinger TA, Ho PH, Nicollin X, Olivero A, Sifakis J, Yovine S. The algorithmic analysis of hybrid systems. Theor Comput Sci 138: 3-34, 1995.
-
(1995)
Theor Comput Sci
, vol.138
, pp. 3-34
-
-
Alur, R.1
Courcoubetis, C.2
Halbawachs, N.3
Henzinger, T.A.4
Ho, P.H.5
Nicollin, X.6
Olivero, A.7
Sifakis, J.8
Yovine, S.9
-
4
-
-
0028413052
-
A theory of timed automata
-
Alur R, Dill D. A theory of timed automata. Theor Comput Sci 126: 183-235, 1994.
-
(1994)
Theor Comput Sci
, vol.126
, pp. 183-235
-
-
Alur, R.1
Dill, D.2
-
5
-
-
0000333926
-
Discrete abstractions of hybrid systems
-
Alur R, Henzinger TA, Lafferriere G, Pappas GJ. Discrete abstractions of hybrid systems. Proc IEEE 88(7): 971-984, 2000.
-
(2000)
Proc IEEE
, vol.88
, Issue.7
, pp. 971-984
-
-
Alur, R.1
Henzinger, T.A.2
Lafferriere, G.3
Pappas, G.J.4
-
7
-
-
41149144239
-
Approximate symbolic model checking of continous-time Markov chains
-
In Baeten JCM, Mauw S, editors, in Lecture Notes in Computer Sciences, Springer-Verlag, Berlin
-
Baier C, Katoen J-P, Hermanns H. Approximate symbolic model checking of continous-time Markov chains. In Baeten JCM, Mauw S, editors, Concurrency Theory, number 1664 in Lecture Notes in Computer Sciences, pages 146-162. Springer-Verlag, Berlin, 1999.
-
(1999)
Concurrency Theory
, Issue.1664
, pp. 146-162
-
-
Baier, C.1
Katoen, J.-P.2
Hermanns, H.3
-
8
-
-
0016515669
-
Convergence of discretization procedures in dynamic programming
-
Bertsekas DP. Convergence of discretization procedures in dynamic programming. IEEE Trans Autom Control 20(3): 415-419, 1975.
-
(1975)
IEEE Trans Autom Control
, vol.20
, Issue.3
, pp. 415-419
-
-
Bertsekas, D.P.1
-
10
-
-
85180894534
-
-
Blom HAP, Lygeros J (eds.)., in Lecture Notes in Control and Information Sciences. Springer-Verlag, Berlin
-
Blom HAP, Lygeros J (eds.). Stochastic Hybrid Systems: Theory and Safety Critical Applications. Number 337 in Lecture Notes in Control and Information Sciences. Springer-Verlag, Berlin, 2006.
-
(2006)
Stochastic Hybrid Systems: Theory and Safety Critical Applications
, Issue.337
-
-
-
11
-
-
35048857490
-
Extended stochastic hybrid systems and their reachability problem
-
In Alur R, Pappas GJ, editors, in Lecture Notes in Computer Sciences, Springer- Verlag, Berlin
-
Bujorianu M. Extended stochastic hybrid systems and their reachability problem. In Alur R, Pappas GJ, editors, Hybrid Systems: Computation and Control, number 2993 in Lecture Notes in Computer Sciences, pages 234-249. Springer- Verlag, Berlin, 2004.
-
(2004)
Hybrid Systems: Computation and Control
, Issue.2993
, pp. 234-249
-
-
Bujorianu, M.1
-
12
-
-
35248884760
-
Reachability questions in piecewise deterministic Markov processes
-
In Maler O, Pnueli A, editors, in Lecture Notes in Computer Sciences, Springer-Verlag, Berlin
-
Bujorianu ML, Lygeros J. Reachability questions in piecewise deterministic Markov processes. In Maler O, Pnueli A, editors, Hybrid Systems: Computation and Control, number 2623 in Lecture Notes in Computer Sciences, pages 126-140. Springer-Verlag, Berlin, 2003.
-
(2003)
Hybrid Systems: Computation and Control
, Issue.2623
, pp. 126-140
-
-
Bujorianu, M.L.1
Lygeros, J.2
-
13
-
-
36049008313
-
-
Cassandras CG, Lygeros J (eds.), Number 24 in Control Engineering. CRC Press, Boca Raton
-
Cassandras CG, Lygeros J (eds.). Stochastic Hybrid Systems. Number 24 in Control Engineering. CRC Press, Boca Raton, 2006.
-
(2006)
Stochastic Hybrid Systems
-
-
-
15
-
-
84976740260
-
The complexity of probabilistic verification
-
Courcoubetis C, Yannakakis M. The complexity of probabilistic verification. J ACM 42(4): 857-907, 1995.
-
(1995)
J ACM
, vol.42
, Issue.4
, pp. 857-907
-
-
Courcoubetis, C.1
Yannakakis, M.2
-
18
-
-
35048826324
-
Benchmarks for hybrid systems verifications
-
In Alur R, Pappas GJ, editors, Springer Verlag
-
Fehnker A, Ivančíc F. Benchmarks for hybrid systems verifications. In Alur R, Pappas GJ, editors, Hybrid Systems: Computation and Control, Lecture Notes in Computer Science 2993, pages 326-341. Springer Verlag, 2004.
-
(2004)
Hybrid Systems: Computation and Control, Lecture Notes in Computer Science
, Issue.2993
, pp. 326-341
-
-
Fehnker, A.1
Ivančíc, F.2
-
19
-
-
70350018305
-
Stochastic satisfiability modulo theory: A novel technique for the analysis of probabilistic hybrid systems
-
In Egerstedt M, Misra B, editors, Berlin, Heidelberg, Springer-Verlag
-
Fränzle M, Hermanns H, Teige T. Stochastic satisfiability modulo theory: A novel technique for the analysis of probabilistic hybrid systems. In Egerstedt M, Misra B, editors, Hybrid Systems: Computation and Control, pages 172-186, Berlin, Heidelberg, 2008. Springer-Verlag. 21
-
(2008)
Hybrid Systems: Computation and Control
, vol.21
, pp. 172-186
-
-
Fränzle, M.1
Hermanns, H.2
Teige, T.3
-
20
-
-
0003096318
-
A logic for reasoning about time and reliability
-
Hansson H, Jonsson B. A logic for reasoning about time and reliability. Form Asp Comput 6(5): 512-535, 1994.
-
(1994)
Form Asp Comput
, vol.6
, Issue.5
, pp. 512-535
-
-
Hansson, H.1
Jonsson, B.2
-
21
-
-
0032140730
-
What's decidable about hybrid automata
-
Henzinger T, Kopke P, Puri A, Varaiya P. What's decidable about hybrid automata. J Comput Syst Sci 57: 94-124, 1998.
-
(1998)
J Comput Syst Sci
, vol.57
, pp. 94-124
-
-
Henzinger, T.1
Kopke, P.2
Puri, A.3
Varaiya, P.4
-
22
-
-
33750308810
-
A Markov reward model checker
-
In, Los Alamos, CA, USA
-
Katoen J-P, Khattri M, Zapreev IS. A Markov reward model checker. In Quantitative Evaluation of Systems (QEST), pages 243-244, Los Alamos, CA, USA, 2005.
-
(2005)
Quantitative Evaluation of Systems (QEST)
, pp. 243-244
-
-
Katoen, J.-P.1
Khattri, M.2
Zapreev, I.S.3
-
23
-
-
33745777189
-
Computational methods for reachability analysis of stochastic hybrid systems
-
In Hespanha J, Tiwari A, editors, in Lecture Notes in Computer Sciences, Springer-Verlag, Berlin
-
Koutsoukos K, Riley D. Computational methods for reachability analysis of stochastic hybrid systems. In Hespanha J, Tiwari A, editors, Hybrid Systems: Computation and Control, number 3927 in Lecture Notes in Computer Sciences, pages 377-391. Springer-Verlag, Berlin, 2006.
-
(2006)
Hybrid Systems: Computation and Control
, Issue.3927
, pp. 377-391
-
-
Koutsoukos, K.1
Riley, D.2
-
26
-
-
84885235139
-
Verifying quantitative properties of continuous probabilistic timed automata
-
In, in Lecture Notes in Computer Sciences, Springer-Verlag, Berlin
-
Kwiatkowska M, Norman G, Segala R, Sproston J. Verifying quantitative properties of continuous probabilistic timed automata. In CONCUR'00, number 1877 in Lecture Notes in Computer Sciences, pages 123-137. Springer-Verlag, Berlin, 2000.
-
(2000)
CONCUR'00
, Issue.1877
, pp. 123-137
-
-
Kwiatkowska, M.1
Norman, G.2
Segala, R.3
Sproston, J.4
-
27
-
-
33845532993
-
Monte Carlo optimization for conict resolution in air traffic control
-
Lecchini A, Glover W, Lygeros J, Maciejowski J. Monte Carlo optimization for conict resolution in air traffic control. IEEE Trans Intell Transp Syst 7(4): 470-482, 2006.
-
(2006)
IEEE Trans Intell Transp Syst
, vol.7
, Issue.4
, pp. 470-482
-
-
Lecchini, A.1
Glover, W.2
Lygeros, J.3
Maciejowski, J.4
-
28
-
-
0022118190
-
Electric load model synthesis by diffusion approximation of a high-order hybrid-state stochastic system
-
Malhame R, Chong C-Y. Electric load model synthesis by diffusion approximation of a high-order hybrid-state stochastic system. IEEE Trans Autom Control 30(9): 854-860, 1985.
-
(1985)
IEEE Trans Autom Control
, vol.30
, Issue.9
, pp. 854-860
-
-
Malhame, R.1
Chong, C.-Y.2
-
31
-
-
34548207741
-
A framework for worstcase and stochastic safety verification using barrier certificates
-
Prajna S, Jadbabaie A, Pappas GJ. A framework for worstcase and stochastic safety verification using barrier certificates. IEEE Trans Autom Control 52(8): 1415-1428, 2007.
-
(2007)
IEEE Trans Autom Control
, vol.52
, Issue.8
, pp. 1415-1428
-
-
Prajna, S.1
Jadbabaie, A.2
Pappas, G.J.3
-
32
-
-
85056314263
-
Stochastic reachability: Theory and numerical approximation
-
In Cassandras CG, Lygeros J, editors, Taylor & Automation and Control Engineering Series 24, Francis Group/CRC Press
-
Prandini M, Hu J. Stochastic reachability: Theory and numerical approximation. In Cassandras CG, Lygeros J, editors, Stochastic hybrid systems, Automation and Control Engineering Series 24, pages 107-138. Taylor & Francis Group/CRC Press, 2006.
-
(2006)
Stochastic hybrid systems
, pp. 107-138
-
-
Prandini, M.1
Hu, J.2
|