Blick ins Buch

Formal Modeling and Analysis of Timed Systems

10th International Conference, FORMATS 2012, London, UK, September 18-20, 2012, Proceedings

Marcin Jurdzinski, Dejan Nickovic (Herausgeber)

Buch | Softcover

X, 267 Seiten

2012 | 2012
Springer Berlin (Verlag)
978-3-642-33364-4 (ISBN)

Lese- und Medienproben

Inhaltsverzeichnis (PDF)

Artikel merken

This book constitutes the refereed proceedings of the 10th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2012, held in London, UK in September 2012.The 16 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 34 submissions. The book covers topics of foundations and semantics, methods and tools, techniques, algorithms, hybrid automata, appilcations, real-time software and hardware circuits.

Invited Talks.-Model-Driven Design-Space Exploration for Software-Intensive Embedded Systems (Extended Abstract).-Statistical Model Checking, Refinement Checking, Optimization, for Stochastic Hybrid Systems.-Robustness of Time Petri Nets under Architectural Constraints .-Toward a Timed Theory of Channel Coding .-Playing Optimally on Timed Automata with Random Delays.-Dynamically-Driven Timed Automaton Abstractions for Proving Liveness of Continuous Systems.-Revisiting Timed Specification Theories: A Linear-Time Perspective .-Multi-core Reachability for Timed Automata .-Counterexample-Guided Synthesis of Observation Predicates.-Confidence Bounds for Statistical Model Checking of Probabilistic Hybrid Systems .-Region-Based Analysis of Hybrid Petri Nets with a Single General One-Shot Transition.-Reducing Quasi-Equal Clocks in Networks of Timed Automata.-SMT-Based Induction Methods for Timed Systems .-Timed Automata with Disjoint Activity.-The Complexity of Bounded Synthesis for Timed Control with Partial Observability .-Static Detection of Zeno Runs in UPPAAL Networks Based on Synchronization Matrices and Two Data-Variable Heuristics.-Frequencies in Forgetful Timed Automata .-Mcta: Heuristics and Search for Timed Systems.

Erscheint lt. Verlag	17.8.2012
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	X, 267 p. 71 illus.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	436 g
Themenwelt	Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge
	Mathematik / Informatik ► Informatik ► Software Entwicklung
	Informatik ► Theorie / Studium ► Algorithmen
Schlagworte	Algorithm analysis and problem complexity • Automated Verification • complexity analysis • Model Checking • symbolic reachability • timed automata
ISBN-10	3-642-33364-8 / 3642333648
ISBN-13	978-3-642-33364-4 / 9783642333644
Zustand	Neuware