000 03684nam a22005655i 4500
001 978-3-540-31616-9
003 DE-He213
005 20240423125307.0
007 cr nn 008mamaa
008 100409s2005 gw | s |||| 0|eng d
020 _a9783540316169
_9978-3-540-31616-9
024 7 _a10.1007/11603009
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aFormal Modeling and Analysis of Timed Systems
_h[electronic resource] :
_bThird International Conference, FORMATS 2005, Uppsala, Sweden, September 26-28, 2005, Proceedings /
_cedited by Paul Pettersson, Wang Yi.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aIX, 305 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aProgramming and Software Engineering,
_x2945-9168 ;
_v3829
505 0 _aInvited 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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aCompilers (Computer programs).
650 0 _aComputers, Special purpose.
650 1 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aSoftware Engineering.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aSpecial Purpose and Application-Based Systems.
700 1 _aPettersson, Paul.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aYi, Wang.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540309468
776 0 8 _iPrinted edition:
_z9783540818960
830 0 _aProgramming and Software Engineering,
_x2945-9168 ;
_v3829
856 4 0 _uhttps://doi.org/10.1007/11603009
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c176368
_d176368