Jun Sun
Yang Liu
Étienne André
Skip Abstract Section
Abstract
Modeling and verifying complex real-time systems are challenging research problems. The de facto approach is based on Timed Automata, which are finite state automata equipped with clock variables. Timed Automata are deficient in modeling hierarchical complex systems. In this work, we propose a language called Stateful Timed CSP and an automated approach for verifying Stateful Timed CSP models. Stateful Timed CSP is based on Timed CSP and is capable of specifying hierarchical real-time systems. Through dynamic zone abstraction, finite-state zone graphs can be generated automatically from Stateful Timed CSP models, which are subject to model checking. Like Timed Automata, Stateful Timed CSP models suffer from Zeno runs, that is, system runs that take infinitely many steps within finite time. Unlike Timed Automata, model checking with non-Zenoness in Stateful Timed CSP can be achieved based on the zone graphs. We extend the PAT model checker to support system modeling and verification using Stateful Timed CSP and show its usability/scalability via verification of real-world systems.
- Aceto, L., Bouyer, P., Burgueño, A., and Larsen, K. G. 2003. The power of reachability testing for timed automata. Theor. Comput. Sci. 300, 1--3, 411--475. Google Scholar
Digital Library
- Alur, R. and Dill, D. L. 1994. A theory of timed automata. Theor. Comput. Sci. 126, 183--235. Google ScholarDigital Library
- Barold, S. S., Stroopbandt, R. X., and Sinnaeve, A. F. 2004. Cardiac Pacemakers Step by Step: An Illustrated Guide. Blackwell Publishing.Google Scholar
- Behrmann, G., Larsen, K. G., Pearson, J., Weise, C., and Yi, W. 1999. Efficient timed reachability analysis using clock difference diagrams. In Proceedings of the 11th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 1633. Springer, 341--353. Google ScholarDigital Library
- Bengtsson, J. and Yi, W. 2003. Timed automata: Semantics, algorithms and tools. In Lectures on Concurrency and Petri Nets. Lecture Notes in Computer Science, vol. 3098. Springer, 87--124.Google Scholar
- Berthomieu, B. and Menasche, M. 1983. An enumerative approach for analyzing time Petri nets. In Proceedings of the IFIP Congress. 41--46.Google Scholar
- Bowman, H. and Gómez, R. 2006. How to stop time stopping. Formal Aspects Comput. 18, 4, 459--493. Google ScholarCross Ref
- Bozga, M., Daws, C., Maler, O., Olivero, A., Tripakis, S., and Yovine, S. 1998. Kronos: A model-checking tool for real-time systems. In Proceedings of the 10th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 1427. Springer, 546--550. Google ScholarDigital Library
- Brooke, P. 1999. A timed semantics for a hierarchical design notation. Ph.D. thesis, University of York.Google Scholar
- Butterfield, A., Sherif, A., and Woodcock, J. 2007. Slotted-circus. InProceedings of the 6th International Conference on Integrated Formal Methods. Lecture Notes in Computer Science, vol. 4591. Springer, 75--97. Google ScholarDigital Library
- Chaki, S., Clarke, E. M., Ouaknine, J., Sharygina, N., and Sinha, N. 2004. State/event-based software model checking. In Proceedings of the 4th International Conference on Integrated Formal Methods. Lecture Notes in Computer Science, vol. 2999. Springer, 128--147.Google Scholar
- Closse, E., Poize, M., Pulou, J., Sifakis, J., Venter, P., Weil, D., and Yovine, S. 2001. TAXYS: A tool for the development and verification of real-time embedded system. In Proceedings of the 13th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 2102. Springer, 391--395. Google ScholarDigital Library
- David, A., David, R., and Möller, M. O. 2001. From HUPPAAL to UPPAAL - A Translation from Hierarchical Timed Automata to Flat Timed Automata.Google Scholar
- Davies, J. 1993. Specification and Proof in Real-Time CSP. Cambridge University Press. Google ScholarDigital Library
- Dill, D. L. 1989. Timing assumptions and verification of finite-state concurrent systems. In Proceedings of the International Workshop onAutomatic Verification Methods for Finite State Systems. Lecture Notes in Computer Science, vol. 407. Springer, 197--212. Google ScholarDigital Library
- Dong, J. S., Hao, P., Qin, S. C., Sun, J., and Yi, W. 2004. Timed patterns: TCOZ to timed automata. In Proceedings of the 3rd International Conference on Formal Engineering Methods. Lecture Notes in Computer Science, vol. 3308. Springer, 483--498.Google Scholar
- Dong, J. S., Hao, P., Qin, S. C., Sun, J., and Yi, W. 2008. Timed Automata Patterns. IEEE Trans. Software Eng. 34, 6, 844--859. Google ScholarDigital Library
- Dong, J. S., Hao, P., Sun, J., and Zhang, X. 2006. A reasoning method for timed CSP based on constraint solving. In Proceedings of the 8th International Conference on Formal Engineering Methods. Lecture Notes in Computer Science, vol. 4260. Springer, 342--359. Google ScholarDigital Library
- Dong, J. S., Mahony, B. P., and Fulton, N. 1999. Modeling Aircraft Mission Computer Task Rates. In Proceedings of the World Congress on Formal Methods in the Development of Computing Systems. Lecture Notes in Computer Science, vol. 1708. Springer, 1855. Google ScholarDigital Library
- Floyd, R. W. 1962. Algorithm 97: Shortest path. Commun. ACM 5, 6, 345. Google ScholarDigital Library
- Gastin, P. and Oddoux, D. 2001. Fast LTL to Büchi automata translation. In Proceedings of the 14th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 2102. Springer, 53--65. Google ScholarDigital Library
- Gómez, R. and Bowman, H. 2007. Efficient detection of Zeno runs in Timed Automata. In Proceedings of the 5th International Conference on Formal Modeling and Analysis of Timed Systems. Lecture Notes in Computer Science, vol. 4763. Springer, 195--210. Google ScholarDigital Library
- Harel, D. 1997. Some thoughts on statecharts, 13 years later. In Proceedings of the 9th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 1254. Springer, 226--231. Google ScholarDigital Library
- Harel, D. and Gery, E. 1997. Executable object modeling with statecharts. IEEE Comput. 30, 7, 31--42. Google ScholarDigital Library
- Henzinger, T. A., Nicollin, X., Sifakis, J., and Yovine, S. 1994. Symbolic model checking for real-time systems. Inf. Comput. 111, 2, 193--244. Google ScholarDigital Library
- Herbreteau, F. and Srivathsan, B. 2010. Efficient on-the-fly emptiness check for timed büchi automata. In Proceedings of the 8th International Symposium on Automated Technology for Verification and Analysis. Springer. Google ScholarDigital Library
- Herbreteau, F., Srivathsan, B., and Walukiewicz, I. 2010. Efficient emptiness check for timed Büchi automata. In Proceedings of the 22nd International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 6174. Springer, 148--161. Google ScholarDigital Library
- Hoare, C. A. R. 1985. Communicating Sequential Processes. International Series in Computer Science. Prentice-Hall. Google ScholarDigital Library
- Holzmann, G. J. 2003. The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley. Google ScholarDigital Library
- Jin, X., Ma, H., and Gu, Z. 2007. Real-time component composition using hierarchical timed automata. In Proceedings of the 7th International Conference on Quality Software. IEEE Computer Society, 90--99. Google ScholarDigital Library
- Lai, L. M. and Watson, P. 1997. A case study in timed CSP: The railroad crossing problem. In Proceedings of the International Workshop on Hybrid and Real-Time Systems. Lecture Notes in Computer Science, vol. 1201. Springer, 69--74. Google ScholarDigital Library
- Larsen, K. G., Pettersson, P., and Wang, Y. 1997. Uppaal in a nutshell. Int. J. Softw. Tools Technol. Trans. 1, 1--2, 134--152.Google ScholarDigital Library
- Lindahl, M., Pettersson, P., and Wang, Y. 2001. Formal design and analysis of a gearbox controller. Int. J. Softw. Tools Technol. Trans. 3, 3, 353--368.Google ScholarCross Ref
- Liu, Y., Sun, J., and Dong, J. S. 2010. Developing model checkers using PAT. In Proceedings of the 8th International Symposium on Automated Technology for Verification and Analysis. Springer. Google ScholarDigital Library
- Liu, Y., Sun, J., and Dong, J. S. 2011. PAT 3: An extensible architecture for building multidomain model checkers. In Proceedings of the 22nd International Symposium on Software Reliability Engineering. ACM. Google ScholarDigital Library
- Lynch, N. A. and Vaandrager, F. W. 1996. Action transducers and timed automata. Formal Asp. Comput. 8, 5, 499--538.Google ScholarCross Ref
- Mahony, B. P. and Dong, J. S. 1998. Network topology and a case study in TCOZ. In Proceedings of the 11th International Conference of Z Users. Lecture Notes in Computer Science, vol. 1493. Springer, 308--327. Google ScholarDigital Library
- Mahony, B. P. and Dong, J. S. 2000. Timed communicating object Z. IEEE Trans. Soft. Eng. 26, 2, 150--177. Google ScholarDigital Library
- Nicollin, X. and Sifakis, J. 1994. The algebra of timed processes, ATP: Theory and application. Inf. Comput. 114, 1, 131--178. Google ScholarDigital Library
- Nicollin, X., Sifakis, J., and Yovine, S. 1992. Compiling Real-Time Specifications into Extended Automata. IEEE Trans. Soft. Eng. 18, 9, 794--804. Google ScholarDigital Library
- Ouaknine, J. and Worrell, J. 2002. Timed CSP = closed timed safety automata. Electr. Notes Theor. Comput. Sci. 68, 2, 142--159.Google ScholarCross Ref
- Ramchandani, C. 1974. Analysis of asynchronous concurrent systems by timed Petri nets. Ph.D. thesis, Massachusetts Institute of Technology.Google Scholar
- Reed, G. M. and Roscoe, A. W. 1986. A timed model for communicating sequential processes. In Proceedings of the 13th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 226. Springer, 314--323. Google ScholarDigital Library
- Rokichi, T. G. 1993. Representing and modeling digital circuits. Ph.D. thesis. Google ScholarDigital Library
- Roscoe, A. W. 2001. Compiling shared variable programs into CSP. In Proceedings of PROGRESS Workshop.Google Scholar
- Roscoe, A. W. 2005. On the Expressive Power of CSP Refinement. Formal Aspects Comput. 17, 2, 93--112. Google ScholarCross Ref
- Roscoe, A. W., Gardiner, P. H. B., Goldsmith, M., Hulance, J. R., Jackson, D. M., and Scattergood, J. B. 1995. Hierarchical compression for model-checking CSP or how to check 1020 dining philosophers for deadlock. In Proceedings of the 1st International Workshop on Tools and Algorithms for Construction and Analysis of Systems. Lecture Notes in Computer Science, vol. 1019. Springer, 133--152. Google ScholarDigital Library
- Schneider, S. 1995. An operational semantics for timed CSP. Inf. Comput. 116, 2, 193--213. Google ScholarDigital Library
- Schneider, S. 2000. Concurrent and Real-Time Systems. John Wiley and Sons.Google Scholar
- Sifakis, J. 1999. The compositional specification of timed systems: A tutorial. In Proceedings of the 11th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 1633. Springer, 2--7. Google ScholarDigital Library
- Sun, J., Liu, Y., Dong, J. S., Liu, Y., and Shi, L. Stateful timed CSP: Models and experiments. http://www.comp.nus.edu.sg/˜ pat/rts.Google Scholar
- Sun, J., Liu, Y., Dong, J. S., and Pang, J. 2009a. PAT: Towards flexible verification under fairness. In Proceedings of the 20th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 5643. Springer. Google ScholarDigital Library
- Sun, J., Liu, Y., Dong, J. S., and Zhang, X. 2009b. Verifying stateful timed CSP using implicit clocks and zone abstraction. In Proceedings of the 11th IEEE International Conference on Formal Engineering Methods. Lecture Notes in Computer Science, vol. 5885. Springer, 581--600. Google ScholarDigital Library
- Tasiran, S., Alur, R., Kurshan, R. P., and Brayton, R. K. 1996. Verifying abstractions of timed systems. In Proceedings of the 7th International Conference on Concurrency Theory. Lecture Notes in Computer Science, vol. 1119. Springer, 546--562. Google ScholarDigital Library
- Tripakis, S. 1999. Verifying progress in timed systems. In Proceedings of the 5th International AMAST Workshop ARTS on Formal Methods for Real-Time and Probabilistic Systems. Lecture Notes in Computer Science, vol. 1601. Springer, 299--314. Google ScholarDigital Library
- Tripakis, S. 2009. Checking Timed Büchi Automata Emptiness on Simulation Graphs. ACM Transactions on Computational Logic 10, 3, 1--19. Google ScholarDigital Library
- Tripakis, S., Yovine, S., and Bouajjani, A. 2005. Checking timed Büchi Automata emptiness efficiently. Formal Meth. Syst. Des. 26, 3, 267--292. Google ScholarDigital Library
- Vardi, M. Y. and Wolper, P. 1986. An automata-theoretic approach to automatic program verification (preliminary report). In Proceedings of the Symposium on Logic in Computer Science. IEEE Computer Society, 332--344.Google Scholar
- Yi, W. 1991. CCS + Time = an interleaving model for real time systems. In Proceedings of the 18th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 510. Springer, 217--228. Google ScholarDigital Library
- Yi, W., Pettersson, P., and Daniels, M. 1994. Automatic verification of real-time communicating systems by constraint-solving. In Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques. IFIP Conference Proceedings, vol. 6. Chapman&Hall, 243--258. Google ScholarDigital Library
Index Terms
- Modeling and verifying hierarchical real-time systems using stateful timed CSP
Recommendations
Modeling and Verifying the TTCAN Protocol Using Timed CSP
TASE '14: Proceedings of the 2014 Theoretical Aspects of Software Engineering Conference (tase 2014)As one of the most practical protocols, Time-Triggered CAN protocol (TTCAN), which is time triggered to ensure the real-time capability required by embedded systems, has been widely used in the automotive electric system development. In this paper, we ...
Analyzing hierarchical complex real-time systems
FSE '10: Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineeringSpecification and verification of real-time systems are important research topics which have practical implications. In this work, we present a self-contained toolkit to analyze real-time systems, which supports system modeling, animated simulation and ...
A Systematic Study on Explicit-State Non-Zenoness Checking for Timed Automata
Zeno runs, where infinitely many actions occur within finite time, may arise in Timed Automata models. Zeno runs are not feasible in reality and must be pruned during system verification. Thus it is necessary to check whether a run is Zeno or not so as to ...
Comments