LEADER 04949nam 2200649 a 450 001 9910483179603321 005 20200520144314.0 010 $a1-280-38846-3 010 $a9786613566386 010 $a3-642-15297-X 024 7 $a10.1007/978-3-642-15297-9 035 $a(CKB)2670000000045047 035 $a(SSID)ssj0000446475 035 $a(PQKBManifestationID)11249936 035 $a(PQKBTitleCode)TC0000446475 035 $a(PQKBWorkID)10496508 035 $a(PQKB)11381528 035 $a(DE-He213)978-3-642-15297-9 035 $a(MiAaPQ)EBC3065790 035 $a(PPN)149024665 035 $a(EXLCZ)992670000000045047 100 $a20100713d2010 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFormal modeling and analysis of timed systems $e8th International Conference, FORMATS 2010, Klosterneuburg, Austria, September 8-10, 2010 : proceedings /$fKrishnendu Chatterjee, Thomas A. Henzinger (eds.) 205 $a1st ed. 2010. 210 $aNew York $cSpringer$d2010 215 $a1 online resource (X, 257 p. 55 illus.) 225 1 $aLecture notes in computer science, 0302-9743 ;$v6246 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-15296-1 320 $aIncludes bibliographical references and index. 327 $aInterdisciplinary Foundations for Open Cyber-Physical Systems -- Safraless Procedures for Timed Specifications -- Property-Based Monitoring of Analog and Mixed-Signal Systems -- A Framework for Verification of Software with Time and Probabilities -- Synchrony and Time in Fault-Tolerant Distributed Algorithms -- Reconciling Urgency and Variable Abstraction in a Hybrid Compositional Setting -- Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games -- Natural Domain SMT: A Preliminary Assessment -- Robust Satisfaction of Temporal Logic over Real-Valued Signals -- Combining Symbolic Representations for Solving Timed Games -- Expected Reachability-Time Games -- Diagnosis Using Unfoldings of Parametric Time Petri Nets -- From Mtl to Deterministic Timed Automata -- Unambiguity in Timed Regular Languages: Automata and Logics -- A Process Algebraic Framework for Modeling Resource Demand and Supply -- Memory Event Clocks -- Simulation and Bisimulation for Probabilistic Timed Automata -- Layered Composition for Timed Automata -- A Conformance Testing Relation for Symbolic Timed Automata. 330 $aThis volume contains the papers that were presented at the 8th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2010), held September 8?10, 2010, at IST (Institute of Science and Technology) Austria, in Klosterneuburg, Austria. The modeling andanalysis oftiming aspects of systems is a keyproblem that has been treated independently in several di?erent communities in computer science and related areas. Researchers interested in semantics, veri?cation, re- timescheduling,andperformanceanalysisstudymodelssuchastimedautomata and timed Petri nets, the digital design community focuses on propagation and switching delays, and designers of embedded controllers need to take into - count the time requiredby controllersto compute their responses after sampling the environment. Although the timing-related questions in these separate c- munities have their own speci?c nature, there is a growing awareness that there are basic problems that are common to all of them. In particular, all of these disciplines model and analyze systems whose behavior depends on combinations of logical and timing constraints between occurrences of events. The aim of FORMATS is to promote the study of fundamental and practical aspects of timed systems, and to bring together researchers from di?erent d- ciplines that share an interest in the modeling 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). 410 0$aLecture notes in computer science ;$v6246. 606 $aComputer simulation$vCongresses 606 $aTemporal automata$vCongresses 606 $aFormal methods (Computer science)$vCongresses 606 $aMachine theory$vCongresses 615 0$aComputer simulation 615 0$aTemporal automata 615 0$aFormal methods (Computer science) 615 0$aMachine theory 676 $a004.01/51 701 $aChatterjee$b Krishnendu$01759145 701 $aHenzinger$b T. A$g(Thomas A.)$01759146 712 12$aFORMATS 2010 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483179603321 996 $aFormal modeling and analysis of timed systems$94197510 997 $aUNINA