Emerald: An Automated Modeling and Verification Tool for Component-Based Real-Time Systems

Controller automata, extending timed automata, are a formal theory to model and analyze real-time systems with mutex components. Given a strict partial order over states, an ordered controller automaton can be faithfully translated into a timed automaton. We present a tool named Emerald to translate ordered controller automata into timed automata and perform the transformation between their specifications in order to use the existing model checking engine, UPPAAL.

[1]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[2]  Patricia Bouyer,et al.  Are Timed Automata Updatable? , 2000, CAV.

[3]  Thomas A. Henzinger,et al.  Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..

[4]  Wang Yi,et al.  Timed Automata with Asynchronous Processes: Schedulability and Decidability , 2002, TACAS.

[5]  Eugene Asarin,et al.  Scheduling with timed automata , 2006, Theor. Comput. Sci..

[6]  Kim Guldstrand Larsen,et al.  Formal Modelling and Analysis of an Audio/Video Protocol , 1997 .

[7]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[8]  Robert I. Davis,et al.  Robust Priority Assignment for Fixed Priority Real-Time Systems , 2007, RTSS 2007.

[9]  Guoqiang Li,et al.  Modeling and analysis of real -time systems with mutex components , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW).

[10]  Guoqiang Li.  Measuring Time Lag with Nested Preemptions and Resumptions , 2012, 2012 IEEE 15th International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops.

[11]  Giorgio Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications , 1997 .

[12]  Patricia Bouyer,et al.  Expressiveness of Updatable Timed Automata , 2000, MFCS.

[13]  Wang Yi,et al.  Task automata: Schedulability, decidability and undecidability , 2007, Inf. Comput..

[14]  Joseph Sifakis,et al.  Composition for component-based modeling , 2002, Sci. Comput. Program..

[15]  Wang Yi,et al.  Timed Automata: Semantics, Algorithms and Tools , 2003, Lectures on Concurrency and Petri Nets.

[16]  Patricia Bouyer,et al.  Updatable timed automata , 2004, Theor. Comput. Sci..

[17]  Wang Yi,et al.  Schedulability analysis of fixed-priority systems using timed automata , 2006, Theor. Comput. Sci..

[18]  Arne Skou,et al.  Formal Modeling and Analysis of an Audio/Video Protocol: An Industrial Case Study Using UPPAAL , 1997 .

[19]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[20]  Wang Yi,et al.  Compositional and Symbolic Model-Checking of Real-Time Systems , 1996 .

[21]  Wang Yi,et al.  Modelling and analysis of a commercial field bus protocol , 2000, Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000.

[22]  Wang Yi,et al.  Timed automata as task models for event-driven systems , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).

[23]  Jacques Pulou,et al.  A Methodology and Supporting Tools for the Development of Component-Based Embedded Systems , 2006, Monterey Workshop.

[24]  Guoqiang Li,et al.  Environmental Simulation of Real-Time Systems with Nested Interrupts , 2009, 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering.

[25]  Joseph Sifakis,et al.  D-Finder: A Tool for Compositional Deadlock Detection and Verification , 2009, CAV.

[26]  Wang Yi,et al.  TIMES: A Tool for Schedulability Analysis and Code Generation of Real-Time Systems , 2003, FORMATS.