zbMATH — the first resource for mathematics

Formal modeling and analysis of timed systems. Third international conference, FORMATS 2005, Uppsala, Sweden, September 26–28, 2005. Proceedings. (English) Zbl 1097.68008
Lecture Notes in Computer Science 3829. Berlin: Springer (ISBN 3-540-30946-2/pbk). ix, 305 p. (2005).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1061.68004).
Indexed articles:
Thiele, Lothar, Modular performance analysis of distributed embedded systems, 1 [Zbl 1175.68071]
Maler, Oded; Nickovic, Dejan; Pnueli, Amir, Real time temporal logic: Past, present, future, 2-16 [Zbl 1175.03009]
Lim, Hongping; Kaynar, Dilsun; Lynch, Nancy; Mitra, Sayan, Translating timed I/O automata specifications for theorem proving in PVS, 17-31 [Zbl 1175.68259]
Refsdal, Atle; Husa, Knut Eilif; Stølen, Ketil, Specification and refinement of soft real-time requirements using sequence diagrams, 32-48 [Zbl 1175.68261]
Brihaye, Thomas; Bruyère, Véronique; Raskin, Jean-François, On optimal timed strategies, 49-64 [Zbl 1175.68241]
Adler, Bo Thomas; de Alfaro, Luca; Faella, Marco, Average reward timed games, 65-80 [Zbl 1175.68238]
Behrmann, Gerd; Larsen, Kim G.; Rasmussen, Jacob Illum, Beyond liveness: Efficient parameter synthesis for time bounded liveness, 81-94 [Zbl 1175.68255]
Abdulla, Parosh Aziz, Verification of parameterized timed systems, 95-97 [Zbl 1175.68254]
Hendriks, Martijn, Model checking the time to reach agreement, 98-111 [Zbl 1175.68258]
Bouyer, Patricia; Laroussinie, François; Reynier, Pierre-Alain, Diagonal constraints in timed automata: Forward analysis of timed systems, 112-126 [Zbl 1175.68256]
Subramani, K.; Desovski, D., A new verification procedure for partially clairvoyant scheduling, 127-141 [Zbl 1124.68014]
Doyen, Laurent; Henzinger, Thomas A.; Raskin, Jean-François, Automatic rectangular refinement of affine hybrid systems, 144-161 [Zbl 1175.68243]
Gentilini, Raffaella, Reachability problems on extended o-minimal hybrid automata, 162-176 [Zbl 1175.68245]
Aljazzar, Husain; Hermanns, Holger; Leue, Stefan, Counterexamples for timed probabilistic reachability, 177-195 [Zbl 1175.68239]
Chatain, Thomas; Jard, Claude, Time supervision of concurrent systems using symbolic unfoldings of time Petri nets, 196-210 [Zbl 1175.68274]
Bérard, Beatrice; Cassez, Franck; Haddad, Serge; Lime, Didier; Roux, Olivier H., Comparison of the expressiveness of timed automata and time Petri nets, 211-225 [Zbl 1175.68270]
Henzinger, Thomas A.; Majumdar, Rupak; Prabhu, Vinayak S., Quantifying similarities between timed systems, 226-241 [Zbl 1175.68281]
Corradini, Flavio; Vogler, Walter, Performance of pipelined asynchronous systems, 242-257 [Zbl 1175.68276]
Fokkink, Wan; Pang, Jun; Wijs, Anton, Is timed branching bisimilarity an equivalence indeed?, 258-272 [Zbl 1175.68277]
Altisen, Karine; Tripakis, Stavros, Implementation of timed automata: An issue of semantics or modeling?, 273-288 [Zbl 1175.68240]
Giacobazzi, Roberto; Mastroeni, Isabella, Timed abstract non-interference, 289-303 [Zbl 1175.68252]

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Qxx Theory of computing
00B25 Proceedings of conferences of miscellaneous specific interest
Full Text: DOI