×

Formal modeling and analysis of timed systems. 5th international conference, FORMATS 2007, Salzburg, Austria, October 3–5, 2007. Proceedings. (English) Zbl 1138.68007

Lecture Notes in Computer Science 4763. Berlin: Springer (ISBN 978-3-540-75453-4/pbk). x, 369 p. (2007).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1137.68001).
Indexed articles:
Katoen, Joost-Pieter, Abstraction of probabilistic systems, 1-3 [Zbl 1141.68472]
Cassez, Franck, Efficient on-the-fly algorithms for partially observable timed games, 5-24 [Zbl 1141.93377]
Adams, Sara; Ouaknine, Joël; Worrell, James, Undecidability of universality for timed automata with minimal resources, 25-37 [Zbl 1141.68423]
Batt, Grégory; Ben Salah, Ramzi; Maler, Oded, On timed models of gene networks, 38-52 [Zbl 1141.92310]
Bouyer, Patricia; Markey, Nicolas, Costs are expensive!, 53-68 [Zbl 1142.68045]
Braberman, Víctor; Lucángeli Obes, Jorge; Olivero, Alfredo; Schapachnik, Fernando, Hypervolume approximation in timed automata model checking, 69-81 [Zbl 1141.68456]
Chevalier, Fabrice; D’Souza, Deepak; Prabhakar, Pavithra, Counter-free input-determined timed automata, 82-97 [Zbl 1142.68039]
Cuijpers, Pieter J. L.; Bril, Reinder J., Towards budgeting in real-time calculus: Deferrable servers, 98-113 [Zbl 1141.68350]
Dierks, Henning; Kupferschmid, Sebastian; Larsen, Kim G., Automatic abstraction refinement for timed automata, 114-129 [Zbl 1141.68431]
Dima, Cătălin, Dynamical properties of timed automata revisited, 130-146 [Zbl 1142.68040]
Fainekos, Georgios E.; Pappas, George J., Robust sampling for MITL specifications, 147-162 [Zbl 1141.68464]
Furia, Carlo Alberto; Rossi, Matteo, On the expressiveness of MTL variants over dense time, 163-178 [Zbl 1142.68048]
Giro, Sergio; D’Argenio, Pedro R., Quantitative model checking revisited: Neither decidable nor approximable, 179-194 [Zbl 1141.68466]
Gómez, Rodolfo; Bowman, Howard, Efficient detection of Zeno runs in timed automata, 195-210 [Zbl 1141.68435]
Håkansson, John; Pettersson, Paul, Partial order reduction for verification of real-time components, 211-226 [Zbl 1141.68468]
Jha, Susmit; Brady, Bryan A.; Seshia, Sanjit A., Symbolic reachability analysis of lazy linear hybrid automata, 241-256 [Zbl 1141.93352]
Krcal, Pavel; Stigge, Martin; Yi, Wang, Multi-processor schedulability analysis of preemptive real-time tasks with variable execution times, 274-289 [Zbl 1141.68353]
Podelski, Andreas; Wagner, Silke, Region stability proofs for hybrid systems, 320-335 [Zbl 1141.93353]
Remke, Anne; Haverkort, Boudewijn R., CSL model checking algorithms for infinite-state structured Markov chains, 336-351 [Zbl 1141.68355]
Wang, Farn, Symbolic simulation-checking of dense-time automata, 352-368 [Zbl 1141.68441]

MSC:

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

Citations:

Zbl 1137.68001
Full Text: DOI