Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems

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.

Includes supplementary material: sn.pub/extras