|
|
|
|
| LEADER |
04384nmm a2200421 u 4500 |
| 001 |
EB000385154 |
| 003 |
EBX01000000000000000238206 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
130626 ||| eng |
| 020 |
|
|
|a 9783642152979
|
| 100 |
1 |
|
|a Chatterjee, Krishnendu
|e [editor]
|
| 245 |
0 |
0 |
|a Formal Modeling and Analysis of Timed Systems
|h Elektronische Ressource
|b 8th International Conference, FORMATS 2010, Klosterneuburg, Austria, September 8-10, 2010, Proceedings
|c edited by Krishnendu Chatterjee, Thomas A. Henzinger
|
| 250 |
|
|
|a 1st ed. 2010
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2010, 2010
|
| 300 |
|
|
|a X, 257 p. 55 illus
|b online resource
|
| 505 |
0 |
|
|a Interdisciplinary 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
|
| 653 |
|
|
|a Compilers (Computer programs)
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Compilers and Interpreters
|
| 653 |
|
|
|a Software engineering
|
| 653 |
|
|
|a Programming Techniques
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer programming
|
| 653 |
|
|
|a Software Engineering
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Control theory
|
| 653 |
|
|
|a Systems Theory, Control
|
| 653 |
|
|
|a Machine theory
|
| 653 |
|
|
|a System theory
|
| 700 |
1 |
|
|a Henzinger, Thomas A.
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Theoretical Computer Science and General Issues
|
| 028 |
5 |
0 |
|a 10.1007/978-3-642-15297-9
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-642-15297-9?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 40,151
|
| 520 |
|
|
|a This 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)
|