Atjaunināt sīkdatņu piekrišanu

Formal Modeling and Analysis of Timed Systems: 7th International Conference, FORMATS 2009, Budapest, Hungary, September 14-16, 2009, Proceedings 2009 ed. [Mīkstie vāki]

Edited by , Edited by
  • Formāts: Paperback / softback, 291 pages, height x width: 235x155 mm, weight: 468 g, X, 291 p., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 5813
  • Izdošanas datums: 07-Sep-2009
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642043674
  • ISBN-13: 9783642043673
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 291 pages, height x width: 235x155 mm, weight: 468 g, X, 291 p., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 5813
  • Izdošanas datums: 07-Sep-2009
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642043674
  • ISBN-13: 9783642043673
This volume contains the papers presented at the 7th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS 2009), held during 14 16 September in Budapest, Hungary. Timing aspects of systems from a variety of computer science domains have been treated independently by di erent communities. Researchers interested in semantics, veri cation and performance analysis study models such as timed automata and timed Petri nets, the digital design community focuses on pr- agation and switching delays, while designers of embedded controllers have to take account of the time taken by controllers to compute their responses after samplingtheenvironment.Timing-relatedquestionsintheseseparatedisciplines do have their particularities. However, there is a growing awareness that there are basic problems that are common to all of them. In particular, all these s- disciplines treat systems whose behavior depends on combinationsof logicaland temporal constraints; namely, co

nstraints on the temporal distances between occurrences of events. The aim of FORMATS is to promote the study of fundamental and prac- cal aspects of timed systems, and to bring together researchers from di erent disciplines that share interests in the modelling and analysis of timed systems. Typical topics include (but are not limited to): Foundations and Semantics. Theoretical foundations of timed systems and languages; comparison between di erent models (timed automata, timed Petri nets, hybrid automata, timed process algebra,max-plus algebra, pr- abilistic models). Methods and Tools. Techniques, algorithms, data structures, and software toolsfor analyzingtimed systemsandresolvingtemporalconstraints(sch- uling,worst-caseexecutiontimeanalysis,optimization,modelchecking,te- ing, constraint solving, etc.).
Tapas: Theory Combinations and Practical Applications.- Max-plus
Algebraic Tools for Discrete Event Systems, Static Analysis, and Zero-Sum
Games.- Approximations of Discrete, Continuous, and Hybrid Systems.- Volume
and Entropy of Regular Timed Languages: Analytic Approach.- Synthesis of
Non-Interferent Timed Systems.- Critical Paths in the Partial Order Unfolding
of a Stochastic Petri Net.- Speeding Up Model Checking of Timed-Models by
Combining Scenario Specialization and Live Component Analysis.- Efficient
on-the-fly Algorithm for Checking Alternating Timed Simulation.- Model
Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced
Timed Automata.- Safe Runtime Verification of Real-Time Properties.- Removing
All Silent Transitions from Timed Automata.- Realizability of Real-Time
Logics.- Revisiting Decidability and Optimum Reachability for Multi-Priced
Timed Automata.- Analyzing Real-Time Event-Driven Programs.- A Compositional
Translation of Timed Automata with Deadlines to Uppaal Timed Automata.-
Compositional Abstraction for Stochastic Systems.- Stochastic Games for
Verification of Probabilistic Timed Automata.- Checking Timed Büchi Automata
Emptiness Using LU-Abstractions.- On the Supports of Recognizable Timed
Series.- Machine-Assisted Parameter Synthesis of the Biphase Mark Protocol
Using Event Order Abstraction.- Exploiting Timed Automata for Conformance
Testing of Power Measurements.