05540nam 2200625 a 450 991076818650332120240806001846.03-540-45031-910.1007/11867340(CKB)1000000000283847(SSID)ssj0000317727(PQKBManifestationID)11230711(PQKBTitleCode)TC0000317727(PQKBWorkID)10294517(PQKB)11075202(DE-He213)978-3-540-45031-3(MiAaPQ)EBC3068256(PPN)123138507(EXLCZ)99100000000028384720060808d2006 uy 0engurnn#008mamaatxtccrFormal modeling and analysis of timed systems 4th international conference, FORMATS 2006, Paris, France, September 25-27, 2006 : proceedings /Eugene Asarin, Patricia Bouyer (eds.)1st ed. 2006.Berlin ;New York Springerc20061 online resource (XII, 372 p.)Lecture notes in computer science,0302-9743 ;4202LNCS sublibrary. SL 1, Theoretical computer science and general issuesBibliographic Level Mode of Issuance: Monograph3-540-45026-2 Includes bibliographical references and index.Invited 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.This 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).Lecture notes in computer science ;4202.LNCS sublibrary.SL 1,Theoretical computer science and general issues.FORMATS 2006Computer simulationCongressesTemporal automataCongressesFormal methods (Computer science)CongressesComputer simulationTemporal automataFormal methods (Computer science)004.01/51Asarin E. A(Evgenii Aleksandrovich)1753890Bouyer Patricia1976-1236515MiAaPQMiAaPQMiAaPQBOOK9910768186503321Formal modeling and analysis of timed systems4189953UNINA