Cantitate/Preț
Produs

Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems: Joint International Conferences on Formal Modeling and Analysis of Timed Systems, FORMATS 2004 and Formal Techniques in Real Time and Fault-Tolerant Systems, FTRTFT 2004, Grenoble, France, September 22-24, 2004, Proceedings: Lecture Notes in Computer Science, cartea 3253

Editat de Yassine Lakhnech, Sergio Yovine
en Limba Engleză Paperback – 20 sep 2004

Din seria Lecture Notes in Computer Science

Preț: 33816 lei

Preț vechi: 42270 lei
-20% Nou

Puncte Express: 507

Preț estimativ în valută:
6472 6732$ 5424£

Carte tipărită la comandă

Livrare economică 13-27 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540231677
ISBN-10: 3540231676
Pagini: 412
Ilustrații: X, 402 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.58 kg
Ediția:2004
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Invited Papers.- From Software to Hardware and Back.- Of Elections and Electrons.- Regular Papers.- Formal Verification of an Avionics Sensor Voter Using SCADE.- Mixed Delay and Threshold Voters in Critical Real-Time Systems.- Towards a Methodological Approach to Specification and Analysis of Dependable Automation Systems.- On Two-Sided Approximate Model-Checking: Problem Formulation and Solution via Finite Topologies.- On Timed Automata with Input-Determined Guards.- Decomposing Verification of Timed I/O Automata.- Symbolic Model Checking for Simply-Timed Systems.- Robustness and Implementability of Timed Automata.- Real-Time Testing with Timed Automata Testers and Coverage Criteria.- Monitoring Temporal Properties of Continuous Signals.- A Unified Fault-Tolerance Protocol.- Automating the Addition of Fail-Safe Fault-Tolerance: Beyond Fusion-Closed Specifications.- Modeling and Verification of a Fault-Tolerant Real-Time Startup Protocol Using Calendar Automata.- Static Fault-Tolerant Real-Time Scheduling with “Pseudo-topological” Orders.- The Influence of Durational Actions on Time Equivalences.- Bounded Model Checking for Region Automata.- Some Progress in Satisfiability Checking for Difference Logic.- Model-Checking for Weighted Timed Automata.- Symbolic Model Checking for Probabilistic Timed Automata.- Structured Modeling of Concurrent Stochastic Hybrid Systems.- Computing Schedules for Multithreaded Real-Time Programs Using Geometry.- Forward Reachability Analysis of Timed Petri Nets.- Lazy Approximation for Dense Real-Time Systems.- Learning of Event-Recording Automata.

Caracteristici

Includes supplementary material: sn.pub/extras