Formal Modeling and Analysis of Timed Systems
Editat de Paul Pettersson, Wang Yien Limba Engleză Paperback – 13 dec 2005
Preț: 322.19 lei
Preț vechi: 402.73 lei
-20% Nou
Puncte Express: 483
Preț estimativ în valută:
57.01€ • 66.49$ • 50.06£
57.01€ • 66.49$ • 50.06£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540309468
ISBN-10: 3540309462
Pagini: 320
Ilustrații: IX, 305 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.49 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540309462
Pagini: 320
Ilustrații: IX, 305 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.49 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.