• Medientyp: E-Book; Konferenzbericht
  • Titel: Formal Modeling and Analysis of Timed Systems (vol. # 3829) : Third International Conference, FORMATS 2005, Uppsala, Sweden, September 26-28, 2005, Proceedings
  • Beteiligte: Pettersson, Paul [Sonstige Person, Familie und Körperschaft]; Yi, Wang [Sonstige Person, Familie und Körperschaft]
  • Erschienen: Berlin, Heidelberg: Springer Berlin Heidelberg, 2005
  • Erschienen in: Lecture notes in computer science ; 3829
    Bücher
  • Umfang: Online-Ressource (IX, 305 p. Also available online, digital)
  • Sprache: Englisch
  • DOI: 10.1007/11603009
  • ISBN: 9783540316169
  • Identifikator:
  • RVK-Notation: SS 4800 : Lecture notes in computer science
  • Schlagwörter: Zeitdiskretes System > Formale Methode
    Zeitbehafteter Automat > Formale Methode
    Hybrides System > Formale Methode
    Temporale Logik > Formale Semantik
    Zeitbewertetes Petri-Netz > Formale Methode
  • Entstehung:
  • Anmerkungen:
  • Beschreibung: 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.