Formal Verification of UML Statecharts with Real-Time Extensions
FASE '02 Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering
On Memory-Block Traversal Problems in Model-Checking Timed-Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
UPPAAL - Now, Next, and Future
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
A Real-Time Animator for Hybrid Systems
LCTES '00 Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems
Efficient Timed Reachability Analysis Using Clock Difference Diagrams
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Modeling and verification of parallel processes
Nordic Journal of Computing
Electronic Notes in Theoretical Computer Science (ENTCS)
Developing UPPAAL over 15 years
Software—Practice & Experience
Testing deadlock-freeness in real-time systems: a formal approach
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
FORMAL MODELLING OF REAL-TIME EMBEDDED AUTOMOTIVE ARCHITECTURE
Journal of Integrated Design & Process Science
Hi-index | 0.00 |
This paper presents a formal verification of the start-up algorithm of the DACAPO protocol. The protocol uses TDMA (Time Division Multiple Access) bus arbitration. It was verified that an ensemble of four communicating stations becomes synchronized and operational within a bounded time from an arbitrary initial state. The system model included a clock drift corresponding to 卤10-3. The protocol was modeled using a network of timed automata, and verification was performed using the symbolic model checker UPPAAL.