Fahrenberg, Uli; Legay, Axel; Quaas, Karin Computing branching distances with quantitative games. (English) Zbl 1464.68239 Theor. Comput. Sci. 847, 134-146 (2020). MSC: 68Q85 68Q45 68Q60 91A80 PDFBibTeX XMLCite \textit{U. Fahrenberg} et al., Theor. Comput. Sci. 847, 134--146 (2020; Zbl 1464.68239) Full Text: DOI
Bazille, Hugo; Bournez, Olivier; Gomaa, Walid; Pouly, Amaury On the complexity of bounded time and precision reachability for piecewise affine systems. (English) Zbl 1393.68066 Theor. Comput. Sci. 735, 132-146 (2018). MSC: 68Q25 68Q17 PDFBibTeX XMLCite \textit{H. Bazille} et al., Theor. Comput. Sci. 735, 132--146 (2018; Zbl 1393.68066) Full Text: DOI arXiv
Jovanović, Aleksandra; Kwiatkowska, Marta; Norman, Gethin; Peyras, Quentin Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata. (English) Zbl 1359.68171 Theor. Comput. Sci. 669, 1-21 (2017). MSC: 68Q45 68Q60 68Q87 PDFBibTeX XMLCite \textit{A. Jovanović} et al., Theor. Comput. Sci. 669, 1--21 (2017; Zbl 1359.68171) Full Text: DOI Link
Al-Bataineh, Omar; Reynolds, Mark; French, Tim Finding minimum and maximum termination time of timed automata models with cyclic behaviour. (English) Zbl 1357.68109 Theor. Comput. Sci. 665, 87-104 (2017). MSC: 68Q60 68Q25 68Q45 PDFBibTeX XMLCite \textit{O. Al-Bataineh} et al., Theor. Comput. Sci. 665, 87--104 (2017; Zbl 1357.68109) Full Text: DOI arXiv Link
Bell, Paul C.; Chen, Shang; Jackson, Lisa On the decidability and complexity of problems for restricted hierarchical hybrid systems. (English) Zbl 1353.68158 Theor. Comput. Sci. 652, 47-63 (2016). MSC: 68Q45 68Q25 93C30 PDFBibTeX XMLCite \textit{P. C. Bell} et al., Theor. Comput. Sci. 652, 47--63 (2016; Zbl 1353.68158) Full Text: DOI
Forejt, Vojtěch; Kwiatkowska, Marta; Norman, Gethin; Trivedi, Ashutosh Expected reachability-time games. (English) Zbl 1339.68146 Theor. Comput. Sci. 631, 139-160 (2016). MSC: 68Q45 68Q10 68Q25 91A80 PDFBibTeX XMLCite \textit{V. Forejt} et al., Theor. Comput. Sci. 631, 139--160 (2016; Zbl 1339.68146) Full Text: DOI arXiv
Benerecetti, Massimo; Peron, Adriano Timed recursive state machines: expressiveness and complexity. (English) Zbl 1338.68070 Theor. Comput. Sci. 625, 85-124 (2016). MSC: 68Q05 68Q17 68Q45 68Q85 PDFBibTeX XMLCite \textit{M. Benerecetti} and \textit{A. Peron}, Theor. Comput. Sci. 625, 85--124 (2016; Zbl 1338.68070) Full Text: DOI
Matsikoudis, Eleftherios; Lee, Edward A. The fixed-point theory of strictly causal functions. (English) Zbl 1318.68116 Theor. Comput. Sci. 574, 39-77 (2015). MSC: 68Q55 06B35 54H25 68Q05 68Q10 PDFBibTeX XMLCite \textit{E. Matsikoudis} and \textit{E. A. Lee}, Theor. Comput. Sci. 574, 39--77 (2015; Zbl 1318.68116) Full Text: DOI
Prabhakar, Pavithra; Vladimerou, Vladimeros; Viswanathan, Mahesh; Dullerud, Geir A decidable class of planar linear hybrid systems. (English) Zbl 1318.68112 Theor. Comput. Sci. 574, 1-17 (2015). MSC: 68Q45 PDFBibTeX XMLCite \textit{P. Prabhakar} et al., Theor. Comput. Sci. 574, 1--17 (2015; Zbl 1318.68112) Full Text: DOI
Bouyer, Patricia; Markey, Nicolas; Sankur, Ocan Robust reachability in timed automata and games: a game-based approach. (English) Zbl 1302.68153 Theor. Comput. Sci. 563, 43-74 (2015). MSC: 68Q45 68Q60 91A80 PDFBibTeX XMLCite \textit{P. Bouyer} et al., Theor. Comput. Sci. 563, 43--74 (2015; Zbl 1302.68153) Full Text: DOI
Byg, Joakim; Jacobsen, Morten; Jacobsen, Lasse; Jørgensen, Kenneth Yrke; Møller, Mikael Harkjær; Srba, Jiří TCTL-preserving translations from timed-arc Petri nets to networks of timed automata. (English) Zbl 1359.68216 Theor. Comput. Sci. 537, 3-28 (2014). MSC: 68Q85 68Q45 68Q60 PDFBibTeX XMLCite \textit{J. Byg} et al., Theor. Comput. Sci. 537, 3--28 (2014; Zbl 1359.68216) Full Text: DOI
Larsen, Kim G.; Legay, Axel; Traonouez, Louis-Marie; Wąsowski, Andrzej Robust synthesis for real-time systems. (English) Zbl 1311.68088 Theor. Comput. Sci. 515, 96-122 (2014). MSC: 68Q60 68Q45 91A80 PDFBibTeX XMLCite \textit{K. G. Larsen} et al., Theor. Comput. Sci. 515, 96--122 (2014; Zbl 1311.68088) Full Text: DOI
Dang, Thao; Le Guernic, Colas; Maler, Oded Computing reachable states for nonlinear biological models. (English) Zbl 1211.92023 Theor. Comput. Sci. 412, No. 21, 2095-2107 (2011). MSC: 92C42 68U99 93C95 PDFBibTeX XMLCite \textit{T. Dang} et al., Theor. Comput. Sci. 412, No. 21, 2095--2107 (2011; Zbl 1211.92023) Full Text: DOI
Droste, Manfred; Quaas, Karin A Kleene-Schützenberger theorem for weighted timed automata. (English) Zbl 1217.68128 Theor. Comput. Sci. 412, No. 12-14, 1140-1153 (2011). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Droste} and \textit{K. Quaas}, Theor. Comput. Sci. 412, No. 12--14, 1140--1153 (2011; Zbl 1217.68128) Full Text: DOI
Lanotte, Ruggero; Maggiolo-Schettini, Andrea; Troina, Angelo Weak bisimulation for probabilistic timed automata. (English) Zbl 1208.68160 Theor. Comput. Sci. 411, No. 50, 4291-4322 (2010). MSC: 68Q85 68Q45 PDFBibTeX XMLCite \textit{R. Lanotte} et al., Theor. Comput. Sci. 411, No. 50, 4291--4322 (2010; Zbl 1208.68160) Full Text: DOI
Bartocci, Ezio; Corradini, Flavio; Merelli, Emanuela; Tesei, Luca Detecting synchronisation of biological oscillators by model checking. (English) Zbl 1209.68311 Theor. Comput. Sci. 411, No. 20, 1999-2018 (2010). MSC: 68Q60 PDFBibTeX XMLCite \textit{E. Bartocci} et al., Theor. Comput. Sci. 411, No. 20, 1999--2018 (2010; Zbl 1209.68311) Full Text: DOI
Ölveczky, Peter Csaba; Thorvaldsen, Stian Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude. (English) Zbl 1178.68699 Theor. Comput. Sci. 410, No. 2-3, 254-280 (2009). MSC: 68W40 68M10 68Q42 PDFBibTeX XMLCite \textit{P. C. Ölveczky} and \textit{S. Thorvaldsen}, Theor. Comput. Sci. 410, No. 2--3, 254--280 (2009; Zbl 1178.68699) Full Text: DOI
Bensalem, Saddek; Peled, Doron; Qu, Hongyang; Tripakis, Stavros Automatic generation of path conditions for concurrent timed systems. (English) Zbl 1293.68201 Theor. Comput. Sci. 404, No. 3, 275-292 (2008). MSC: 68Q85 68Q45 PDFBibTeX XMLCite \textit{S. Bensalem} et al., Theor. Comput. Sci. 404, No. 3, 275--292 (2008; Zbl 1293.68201) Full Text: DOI
Bérard, B.; Cassez, F.; Haddad, S.; Lime, D.; Roux, O. H. When are timed automata weakly timed bisimilar to time Petri nets? (English) Zbl 1158.68029 Theor. Comput. Sci. 403, No. 2-3, 202-220 (2008). MSC: 68Q85 68Q45 PDFBibTeX XMLCite \textit{B. Bérard} et al., Theor. Comput. Sci. 403, No. 2--3, 202--220 (2008; Zbl 1158.68029) Full Text: DOI
Asarin, Eugene; Pace, Gordon; Schneider, Gerardo; Yovine, Sergio Algorithmic analysis of polygonal hybrid systems. II: Phase portrait and tools. (English) Zbl 1134.68026 Theor. Comput. Sci. 390, No. 1, 1-26 (2008). MSC: 68Q45 34A60 68Q60 93B05 93C30 PDFBibTeX XMLCite \textit{E. Asarin} et al., Theor. Comput. Sci. 390, No. 1, 1--26 (2008; Zbl 1134.68026) Full Text: DOI
Asarin, Eugene; Schneider, Gerardo; Yovine, Sergio Algorithmic analysis of polygonal hybrid systems. I: Reachability. (English) Zbl 1121.68071 Theor. Comput. Sci. 379, No. 1-2, 231-265 (2007). MSC: 68Q60 34A60 93B03 93C30 PDFBibTeX XMLCite \textit{E. Asarin} et al., Theor. Comput. Sci. 379, No. 1--2, 231--265 (2007; Zbl 1121.68071) Full Text: DOI
Laroussinie, F.; Markey, N.; Schnoebelen, Ph. Efficient timed model checking for discrete-time systems. (English) Zbl 1088.68107 Theor. Comput. Sci. 353, No. 1-3, 249-271 (2006). MSC: 68Q60 PDFBibTeX XMLCite \textit{F. Laroussinie} et al., Theor. Comput. Sci. 353, No. 1--3, 249--271 (2006; Zbl 1088.68107) Full Text: DOI HAL
Abdeddaïm, Yasmina; Asarin, Eugene; Maler, Oded Scheduling with timed automata. (English) Zbl 1088.68023 Theor. Comput. Sci. 354, No. 2, 272-300 (2006). MSC: 68M20 68Q45 PDFBibTeX XMLCite \textit{Y. Abdeddaïm} et al., Theor. Comput. Sci. 354, No. 2, 272--300 (2006; Zbl 1088.68023) Full Text: DOI
Lugiez, D.; Niebert, P.; Zennou, S. A partial order semantics approach to the clock explosion problem of timed automata. (English) Zbl 1079.68052 Theor. Comput. Sci. 345, No. 1, 27-59 (2005). MSC: 68Q45 68Q60 PDFBibTeX XMLCite \textit{D. Lugiez} et al., Theor. Comput. Sci. 345, No. 1, 27--59 (2005; Zbl 1079.68052) Full Text: DOI
Baeten, J. C. M. A brief history of process algebra. (English) Zbl 1080.68072 Theor. Comput. Sci. 335, No. 2-3, 131-146 (2005). MSC: 68Q85 PDFBibTeX XMLCite \textit{J. C. M. Baeten}, Theor. Comput. Sci. 335, No. 2--3, 131--146 (2005; Zbl 1080.68072) Full Text: DOI Link
Bouyer, Patricia; Dufourd, Catherine; Fleury, Emmanuel; Petit, Antoine Updatable timed automata. (English) Zbl 1070.68063 Theor. Comput. Sci. 321, No. 2-3, 291-345 (2004). MSC: 68Q45 PDFBibTeX XMLCite \textit{P. Bouyer} et al., Theor. Comput. Sci. 321, No. 2--3, 291--345 (2004; Zbl 1070.68063) Full Text: DOI
Alur, Rajeev; La Torre, Salvatore; Pappas, George J. Optimal paths in weighted timed automata. (English) Zbl 1068.68080 Theor. Comput. Sci. 318, No. 3, 297-322 (2004). MSC: 68Q60 68Q45 PDFBibTeX XMLCite \textit{R. Alur} et al., Theor. Comput. Sci. 318, No. 3, 297--322 (2004; Zbl 1068.68080) Full Text: DOI
Dang, Zhe Pushdown timed automata: A binary reachability characterization and safety verification. (English) Zbl 1044.68085 Theor. Comput. Sci. 302, No. 1-3, 93-121 (2003). MSC: 68Q45 PDFBibTeX XMLCite \textit{Z. Dang}, Theor. Comput. Sci. 302, No. 1--3, 93--121 (2003; Zbl 1044.68085) Full Text: DOI
Dang, Zhe; Ibarra, Oscar H.; Kemmerer, Richard A. Generalized discrete timed automata: Decidable approximations for safety verification. (English) Zbl 1044.68086 Theor. Comput. Sci. 296, No. 1, 59-74 (2003). MSC: 68Q45 PDFBibTeX XMLCite \textit{Z. Dang} et al., Theor. Comput. Sci. 296, No. 1, 59--74 (2003; Zbl 1044.68086) Full Text: DOI
Ibarra, Oscar H.; Dang, Zhe; San Pietro, Pierluigi Verification in loosely synchronous queue-connected discrete timed automata. (English) Zbl 1044.68096 Theor. Comput. Sci. 290, No. 3, 1713-1735 (2003). MSC: 68Q45 PDFBibTeX XMLCite \textit{O. H. Ibarra} et al., Theor. Comput. Sci. 290, No. 3, 1713--1735 (2003; Zbl 1044.68096) Full Text: DOI
Aceto, Luca; Bouyer, Patricia; Burgueño, Augusto; Larsen, Kim G. The power of reachability testing for timed automata. (English) Zbl 1023.68060 Theor. Comput. Sci. 300, No. 1-3, 411-475 (2003). MSC: 68Q45 PDFBibTeX XMLCite \textit{L. Aceto} et al., Theor. Comput. Sci. 300, No. 1--3, 411--475 (2003; Zbl 1023.68060) Full Text: DOI
Dang, Zhe; San Pietro, Pierluigi; Kemmerer, Richard A. Presburger liveness verification of discrete timed automata. (English) Zbl 1040.68050 Theor. Comput. Sci. 299, No. 1-3, 413-438 (2003). MSC: 68Q45 PDFBibTeX XMLCite \textit{Z. Dang} et al., Theor. Comput. Sci. 299, No. 1--3, 413--438 (2003; Zbl 1040.68050) Full Text: DOI
Ölveczky, Peter Csaba; Meseguer, José Specification of real-time and hybrid systems in rewriting logic. (English) Zbl 1001.68061 Theor. Comput. Sci. 285, No. 2, 359-405 (2002). MSC: 68Q42 68T27 PDFBibTeX XMLCite \textit{P. C. Ölveczky} and \textit{J. Meseguer}, Theor. Comput. Sci. 285, No. 2, 359--405 (2002; Zbl 1001.68061) Full Text: DOI
Kwiatkowska, Marta; Norman, Gethin; Segala, Roberto; Sproston, Jeremy Automatic verification of real-time systems with discrete probability distributions. (English) Zbl 1050.68094 Theor. Comput. Sci. 282, No. 1, 101-150 (2002). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Kwiatkowska} et al., Theor. Comput. Sci. 282, No. 1, 101--150 (2002; Zbl 1050.68094) Full Text: DOI
L’Her, D.; Parc, P. L.; Marcé, L. Proving sequential function chart programs using timed automata. (English) Zbl 0984.68101 Theor. Comput. Sci. 267, No. 1-2, 141-155 (2001). MSC: 68Q45 PDFBibTeX XMLCite \textit{D. L'Her} et al., Theor. Comput. Sci. 267, No. 1--2, 141--155 (2001; Zbl 0984.68101) Full Text: DOI
Springintveld, J.; Vaandrager, F.; D’Argenio, P. R. Testing timed automata. (English) Zbl 0972.68104 Theor. Comput. Sci. 254, No. 1-2, 225-257 (2001). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Springintveld} et al., Theor. Comput. Sci. 254, No. 1--2, 225--257 (2001; Zbl 0972.68104) Full Text: DOI
Campos, S. V. A.; Clarke, E. The Verus language: Representing time efficiently with BDDs. (English) Zbl 0954.68098 Theor. Comput. Sci. 253, No. 1, 95-118 (2001). MSC: 68Q60 PDFBibTeX XMLCite \textit{S. V. A. Campos} and \textit{E. Clarke}, Theor. Comput. Sci. 253, No. 1, 95--118 (2001; Zbl 0954.68098) Full Text: DOI
Henzinger, Thomas A.; Kopke, Peter W. Discrete-time control for rectangular hybrid automata. (English) Zbl 0930.68086 Theor. Comput. Sci. 221, No. 1-2, 369-392 (1999). MSC: 68Q60 68Q45 PDFBibTeX XMLCite \textit{T. A. Henzinger} and \textit{P. W. Kopke}, Theor. Comput. Sci. 221, No. 1--2, 369--392 (1999; Zbl 0930.68086) Full Text: DOI
Alur, Rajeev; Fix, Limor; Henzinger, Thomas A. Event-clock automata: a determinizable class of timed automata. (English) Zbl 0912.68132 Theor. Comput. Sci. 211, No. 1-2, 253-273 (1999). MSC: 68Q60 68Q45 PDFBibTeX XMLCite \textit{R. Alur} et al., Theor. Comput. Sci. 211, No. 1--2, 253--273 (1999; Zbl 0912.68132) Full Text: DOI
Bergeron, Anne On the rational behaviors of concurrent timers. (English) Zbl 0893.68103 Theor. Comput. Sci. 189, No. 1-2, 229-237 (1997). MSC: 68Q45 PDFBibTeX XMLCite \textit{A. Bergeron}, Theor. Comput. Sci. 189, No. 1--2, 229--237 (1997; Zbl 0893.68103) Full Text: DOI
Bournez, Olivier; Cosnard, Michel On the computational power of dynamical systems and hybrid systems. (English) Zbl 0874.68303 Theor. Comput. Sci. 168, No. 2, 417-459 (1996). MSC: 68U20 PDFBibTeX XMLCite \textit{O. Bournez} and \textit{M. Cosnard}, Theor. Comput. Sci. 168, No. 2, 417--459 (1996; Zbl 0874.68303) Full Text: DOI
Gorrieri, Roberto; Roccetti, Marco; Stancampiano, Enrico A theory of processes with durational actions. (English) Zbl 0874.68113 Theor. Comput. Sci. 140, No. 1, 73-94 (1995). MSC: 68Q10 PDFBibTeX XMLCite \textit{R. Gorrieri} et al., Theor. Comput. Sci. 140, No. 1, 73--94 (1995; Zbl 0874.68113) Full Text: DOI
Alur, R.; Courcoubetis, C.; Halbwachs, N.; Henzinger, T. A.; Ho, P.-H. The algorithmic analysis of hybrid systems. (English) Zbl 0874.68206 Theor. Comput. Sci. 138, No. 1, 3-34 (1995). MSC: 68Q45 PDFBibTeX XMLCite \textit{R. Alur} et al., Theor. Comput. Sci. 138, No. 1, 3--34 (1995; Zbl 0874.68206) Full Text: DOI
Asarin, Eugene; Maler, Oded; Pnueli, Amir Reachability analysis of dynamical systems having piecewise-constant derivatives. (English) Zbl 0884.68050 Theor. Comput. Sci. 138, No. 1, 35-65 (1995). MSC: 68Q10 93B05 PDFBibTeX XMLCite \textit{E. Asarin} et al., Theor. Comput. Sci. 138, No. 1, 35--65 (1995; Zbl 0884.68050) Full Text: DOI