04258nam 22006495 450 991048385300332120200701062402.010.1007/11603009(CKB)1000000000213569(SSID)ssj0000317726(PQKBManifestationID)11248913(PQKBTitleCode)TC0000317726(PQKBWorkID)10294611(PQKB)10041810(DE-He213)978-3-540-31616-9(MiAaPQ)EBC3068413(PPN)123099064(EXLCZ)99100000000021356920100409d2005 u| 0engurnn|008mamaatxtccrFormal Modeling and Analysis of Timed Systems Third International Conference, FORMATS 2005, Uppsala, Sweden, September 26-28, 2005, Proceedings /edited by Paul Pettersson, Wang Yi1st ed. 2005.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2005.1 online resource (IX, 305 p.) Programming and Software Engineering ;3829Bibliographic Level Mode of Issuance: MonographPrinted edition: 9783540309468 Includes bibliographical references and index.Invited Talk -- Modular Performance Analysis of Distributed Embedded Systems -- Logic and Specification -- Real Time Temporal Logic: Past, Present, Future -- Translating Timed I/O Automata Specifications for Theorem Proving in PVS -- Specification and Refinement of Soft Real-Time Requirements Using Sequence Diagrams -- Times Games and Synthesis -- On Optimal Timed Strategies -- Average Reward Timed Games -- Beyond Liveness: Efficient Parameter Synthesis for Time Bounded Liveness -- Invited Talk -- Verification of Parameterized Timed Systems -- Model Checking -- Model Checking the Time to Reach Agreement -- Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems -- A New Verification Procedure for Partially Clairvoyant Scheduling -- Invited Talk -- Timing Analysis and Simulation Tools for Real-Time Control -- Hybrid Systems -- Automatic Rectangular Refinement of Affine Hybrid Systems -- Reachability Problems on Extended O-Minimal Hybrid Automata -- Counterexamples for Timed Probabilistic Reachability -- Petri Nets -- Time Supervision of Concurrent Systems Using Symbolic Unfoldings of Time Petri Nets -- Comparison of the Expressiveness of Timed Automata and Time Petri Nets -- Semantics -- Quantifying Similarities Between Timed Systems -- Performance of Pipelined Asynchronous Systems -- Is Timed Branching Bisimilarity an Equivalence Indeed? -- Semantics and Modelling -- Implementation of Timed Automata: An Issue of Semantics or Modeling? -- Timed Abstract Non-interference.Programming and Software Engineering ;3829Computer logicSoftware engineeringProgramming languages (Electronic computers)Special purpose computersLogics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XSoftware Engineeringhttps://scigraph.springernature.com/ontologies/product-market-codes/I14029Programming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Special Purpose and Application-Based Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I13030Computer logic.Software engineering.Programming languages (Electronic computers).Special purpose computers.Logics and Meanings of Programs.Software Engineering.Programming Languages, Compilers, Interpreters.Special Purpose and Application-Based Systems.005.1015113Pettersson Pauledthttp://id.loc.gov/vocabulary/relators/edtYi Wangedthttp://id.loc.gov/vocabulary/relators/edtBOOK9910483853003321Formal Modeling and Analysis of Timed Systems772562UNINA