000 05176nam a22006015i 4500
001 978-3-642-04368-0
003 DE-He213
005 20240730202847.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642043680
_9978-3-642-04368-0
024 7 _a10.1007/978-3-642-04368-0
_2doi
050 4 _aQA76.9.M35
072 7 _aUYAM
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aFormal Modeling and Analysis of Timed Systems
_h[electronic resource] :
_b7th International Conference, FORMATS 2009, Budapest, Hungary, September 14-16, 2009, Proceedings /
_cedited by Joel Ouaknine, Frits W. Vaandrager.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aX, 291 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5813
505 0 _aTapas: 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.
520 _aThis book constitutes the refereed proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2009, held in Budapest, Hungary, September 2009. The 18 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 40 submissions. The aim of FORMATS is to promote the study of fundamental and practical aspects of timed systems, and to bring together researchers from different 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 different models (timed automata, timed Petri nets, hybrid automata, timed process algebra, max-plus algebra, probabilistic models). - Methods and Tools. Techniques, algorithms, data structures, and software tools for analyzing timed systems and resolving temporal constraints (scheduling, worst-case execution time analysis, optimization, model checking, testing, constraint solving, etc.). - Applications. Adaptation and specialization of timing technology in application domains in which timing plays an important role (real-time software, hardware circuits, and problems of scheduling in manufacturing and telecommunication).
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aCompilers (Computer programs).
_93350
650 0 _aSoftware engineering.
_94138
650 0 _aComputer science.
_99832
650 1 4 _aMathematics of Computing.
_931875
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aTheory of Computation.
_9173403
650 2 4 _aModels of Computation.
_931806
700 1 _aOuaknine, Joel.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9173404
700 1 _aVaandrager, Frits W.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9173405
710 2 _aSpringerLink (Online service)
_9173406
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642043673
776 0 8 _iPrinted edition:
_z9783642043697
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5813
_9173407
856 4 0 _uhttps://doi.org/10.1007/978-3-642-04368-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c97217
_d97217