LEADER 05540nam 2200625 a 450 001 9910768186503321 005 20240806001846.0 010 $a3-540-45031-9 024 7 $a10.1007/11867340 035 $a(CKB)1000000000283847 035 $a(SSID)ssj0000317727 035 $a(PQKBManifestationID)11230711 035 $a(PQKBTitleCode)TC0000317727 035 $a(PQKBWorkID)10294517 035 $a(PQKB)11075202 035 $a(DE-He213)978-3-540-45031-3 035 $a(MiAaPQ)EBC3068256 035 $a(PPN)123138507 035 $a(EXLCZ)991000000000283847 100 $a20060808d2006 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFormal modeling and analysis of timed systems $e4th international conference, FORMATS 2006, Paris, France, September 25-27, 2006 : proceedings /$fEugene Asarin, Patricia Bouyer (eds.) 205 $a1st ed. 2006. 210 $aBerlin ;$aNew York $cSpringer$dc2006 215 $a1 online resource (XII, 372 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v4202 225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-45026-2 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Timed Alternating-Time Temporal Logic -- Concurrent Semantics Without the Notions of State or State Transitions -- Decidability and Expressive Power of Real Time Logics -- Contributed Papers -- Extended Directed Search for Probabilistic Timed Reachability -- Intersection of Regular Signal-Event (Timed) Languages -- Refinements and Abstractions of Signal-Event (Timed) Languages -- Bridging the Gap Between Timed Automata and Bounded Time Petri Nets -- Matching Scenarios with Timing Constraints -- Verification of the Generic Architecture of a Memory Circuit Using Parametric Timed Automata -- Model Checking Timed Automata with Priorities Using DBM Subtraction -- Symbolic Robustness Analysis of Timed Automata -- Coping with the Parallelism of BitTorrent: Conversion of PEPA to ODEs in Dealing with State Space Explosion -- Temporal Logic Verification Using Simulation -- Undecidable Problems About Timed Automata -- On Timed Simulation Relations for Hybrid Systems and Compositionality -- Integrating Discrete- and Continuous-Time Metric Temporal Logics Through Sampling -- On the Computational Power of Timed Differentiable Petri Nets -- Model-Checking Timed ATL for Durational Concurrent Game Structures -- A Dose of Timed Logic, in Guarded Measure -- From MITL to Timed Automata -- Adding Invariants to Event Zone Automata -- Static Analysis for State-Space Reduction of Polygonal Hybrid Systems -- On the Expressiveness of MTL with Past Operators -- Simulator for Real-Time Abstract State Machines -- A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes. 330 $aThis volume contains the proceedings of the 4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS 2006), held in Paris (France) on September 25-27, 2006. FORMATS aims to be a major annual event dedicated to the study of timed systems, uniting three independently started workshops: MTCS, RT-TOOLS, and TPTS. The first three FORMATS conferences were held in Marseille (2003), Grenoble (2004), and Uppsala (2005). Timing aspects of systems have been treated independently in separate scientific disciplines, and there is a growing awareness of the difficult problems common to all of them, suggesting the interdisciplinary study of timed systems. The unifying theme underlying all these domains is that they concern systems whose behavior depends upon combinations of logical and temporal constraints, e.g., constraints on the distance 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 different disciplines that share interests in modelling and analysis of timed systems. In this volume, there are articles on: ? Foundations and Semantics: contributions to the theoretical foundations of timed systems and timed formal languages as well as comparison between different models used by different communities (timed automata, timed Petri nets, timed MSCs, hybrid automata, timed process algebra, timed temporal logics, timed abstract state machines, as well as probabilistic models). ? Methods and Tools: techniques, algorithms, data structures, and software tools for analyzing timed systems and resolving temporal constraints (mod- checking, simulation, robustness analysis, scheduling, etc). 410 0$aLecture notes in computer science ;$v4202. 410 0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 517 3 $aFORMATS 2006 606 $aComputer simulation$vCongresses 606 $aTemporal automata$vCongresses 606 $aFormal methods (Computer science)$vCongresses 615 0$aComputer simulation 615 0$aTemporal automata 615 0$aFormal methods (Computer science) 676 $a004.01/51 701 $aAsarin$b E. A$g(Evgenii Aleksandrovich)$01753890 701 $aBouyer$b Patricia$f1976-$01236515 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910768186503321 996 $aFormal modeling and analysis of timed systems$94189953 997 $aUNINA