research-article

Scenario-based timing verification of multiprocessor embedded applications

Authors:

P. P. Chakrabarti,

Rajeev KumarAuthors Info & Claims

ACM Transactions on Design Automation of Electronic Systems (TODAES), Volume 14, Issue 3

Article No.: 37, Pages 1 - 58

https://doi.org/10.1145/1529255.1529259

Published: 04 June 2009 Publication History

Abstract

This work presents a static timing-analysis method for verification of scenario-based real-time properties, on graphical task-level models of embedded applications. Scenario-based properties specify timing constraints which must be honored for specific control-flow behaviors and task execution orderings. Static checking of scenario-based properties currently requires computationally expensive model checking methods. Hence the proposed graph-based static timing-analysis algorithm improves upon the state-of-the-art. This is manifested in a significant performance advantage over timed model checking (up to 1000X in several cases), which suffers from state space explosion. The proposed algorithm also employs compositional reasoning and abstraction refinement for handling large problems. We also illustrate methods for using scenario-based timing analysis, which can act as alternatives to traditional timed model checking for verification of timed systems like FDDI and Fischer protocols. We implement this timing verification algorithm as a tool called SymTime and present experimental results for SymTime comparing it with SPIN, UPPAAL, and a TCTL model checker for Time Petri Nets, called Romeo.

References

[1]

Abadi, M. and Lamport, L. 1994. An old-fashioned recipe for real time. ACM Trans. Program. Lang. Syst. 16, 5, 1543--1571.

Digital Library

[2]

Abadi, M. and Lamport, L. 1995. Conjoining specifications. ACM Trans. Program. Lang. Syst. 17, 3, 507--535.

Digital Library

[3]

Allen, J. F. 1983. Maintaining knowledge about temporal intervals. Commun. ACM 26, 11, 832--843.

Digital Library

[4]

Alur, R., Courcoubetis, C., and Dill, D. L. 1990. Model-Checking for real-time systems. In Annual IEEE Symposium on Logic in Computer Science (LICS'90). IEEE Computer Society, 414--425.

[5]

Alur, R. and Dill, D. 1996. Automata-theoretic verification of real-time systems. In Formal Methods for Real-Time Computing. Trends in Sofware Series, John Wiley and Sons, 55--82.

[6]

Alur, R. and Dill, D. L. 1994. A theory of timed automata. Theor. Comput. Sci. 126, 2, 183--235.

Digital Library

[7]

Alur, R. and Henzinger, T. A. 1994. A really temporal logic. J. ACM 41, 1, 181--203.

Digital Library

[8]

Bahar, R. I., Frohm, E. A., Gaona, C. M., Hachtel, G. D., Macii, E., Pardo, A., and Somenzi, F. 1993. Algebraic decision diagrams and their applications. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD '93). IEEE Computer Society Press, Los Alamitos, CA, 188--191.

Digital Library

[9]

Bahar, R. I., Hachtel, G. D., Macii, E., Pardo, A., Poncino, M., and Somenzi, F. 1994. An ADD-based algorithm for shortest path back-tracing of large graphs. In VLSI Great Lakes Symposium, 248--251.

[10]

Bellini, P., Mattolini, R., and Nesi, P. 2000. Temporal logics for real-time system specification. ACM Comput. Surv. 32, 1, 12--42.

Digital Library

[11]

Beyer, D., Lewerentz, C., and Noack, A. 2003. Rabbit: A tool for BDD-based verification of real-time systems. In International Conference on Computer-Aided Verification (CAV), W. A. H. Jr. and F. Somenzi, Eds. Lecture Notes in Computer Science, vol. 2725. Springer, 122--125.

[12]

Braberman, V., Kicillof, N., and Olivero, A. 2005. A scenario-matching approach to the description and model checking of real-time properties. IEEE Trans. Softw. Eng. 31, 12, 1028--1041.

Digital Library

[13]

Chakraborty, S. and Dill, D. L. 1997. Approximate algorithms for time separation of events. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD '97). IEEE Computer Society, 190--194.

Digital Library

[14]

Clarke, E., Grumberg, O., Jha, S., Lu, Y., and Veith, H. 2003. Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50, 5, 752--794.

Digital Library

[15]

Clarke, E. M., Grumberg, O., and Peled, D., Eds. 2001. Model Checking. The MIT Press.

[16]

Cousot, P. 1996. Abstract interpretation. ACM Comput. Surv. 28, 2, 324--328.

Digital Library

[17]

Das, D., Chakrabarti, P. P., and Kumar, R. 2007. Functional verification of task partitioning for multiprocessor embedded systems. ACM Trans. Des. Autom. Electron. Syst. 12, 4, 44.

Digital Library

[18]

Dasdan, A., Ramanathan, D., and Gupta, R. K. 1998. A timing-driven design and validation methodology for embedded real-time systems. ACM Trans. Des. Autom. Electron. Syst. 3, 4, 533--553.

Digital Library

[19]

Daws, C., Olivero, A., Tripakis, S., and Yovine, S. 1995a. The tool kronos. In Hybrid Systems, R. Alur et al., Eds. Lecture Notes in Computer Science, vol. 1066. Springer, 208--219.

Digital Library

[20]

Daws, C., Olivero, A., Tripakis, S., and Yovine, S. 1995b. The tool KRONOS. In Hybrid Systems III: Verification and Control. Vol. 1066. Springer, 208--219.

Digital Library

[21]

Dill, D. L. 1990. Timing assumptions and verification of finite-state concurrent systems. In Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems. Springer, 197--212.

Digital Library

[22]

Eshuis, R. 2006. Symbolic model checking of uml activity diagrams. ACM Trans. Softw. Eng. Methodol. 15, 1, 1--38.

Digital Library

[23]

Gardey, G., Lime, D., Magnin, M., and Roux, O. H. 2005. Romeo: A tool for analyzing time petri nets. In International Conference on Computer-Aided Verification (CAV), K. Etessami and S. K. Rajamani, Eds. Lecture Notes in Computer Science, vol. 3576. Springer, 418--423.

Digital Library

[24]

Guthaus, M. R., Ringenberg, J. S., Ernst, D., Austin, T. M., Mudge, T., and Brown, R. B. 2001. MiBench: A free, commercially representative embedded benchmark suite. In Proceedings of the IEEE 4th Annual Workshop on Workload Characterization.

Digital Library

[25]

Hendriks, M., Behrmann, G., Larsen, K. G., Niebert, P., and Vaandrager, F. W. 2003. Adding symmetry reduction to Uppaal. See Larsen and Niebert {2003}, 46--59.

[26]

Henzinger, T. A., Nicollin, X., Sifakis, J., and Yovine, S. 1994. Symbolic model checking for real-time systems. Inf. Comput. 111, 2, 193--244.

Digital Library

[27]

Holzmann, G. 1998. An analysis of bitstate hashing. Formal Methods in System Design 13, 3, 287--305. extended and revised version of Proceedings of the PSTV95, 301--314.

Digital Library

[28]

Holzmann, G. J. 1997. The model checker spin. IEEE Trans. Softw. Eng. 23, 5, 279--295.

Digital Library

[29]

Johnsonbaugh, R. and Kalin, M. 1991. A graph generation software package. In Proceedings of the 22nd SIGCSE Technical Symposium on Computer Science Education. ACM Press, New York, 151--154.

Digital Library

[30]

Juan, E. Y. T., Tsai, J. J. P., and Murata, T. 1998. Compositional verification of concurrent systems using petri-net-based condensation rules. ACM Trans. Program. Lang. Syst. 20, 5, 917--979.

Digital Library

[31]

Konrad, S. and Cheng, B. H. C. 2005. Real-Time specification patterns. In Proceedings of the 27th International Conference on Software Engineering (ICSE '05). ACM Press, New York, 372--381.

Digital Library

[32]

Larsen, K. G. and Niebert, P., Eds. 2003. Formal Modeling and Analysis of Timed Systems: 1st International Workshop, FORMATS 2003, Revised Papers. Lecture Notes in Computer Science, vol. 2791. Springer.

[33]

Larsen, K. G., Pearson, J., Weise, C., and Yi, W. 1999. Clock difference diagrams. Nordic J. Comput. 6, 3, 271--298.

Digital Library

[34]

Larsen, K. G., Pettersson, P., and Yi, W. 1997. Uppaal in a nutshell. Int. J. Softw. Tools Technol. Transfer 1, 1-2, 134--152.

Digital Library

[35]

Lugiez, D., Niebert, P., and Zennou, S. 2005. A partial order semantics approach to the clock explosion problem of timed automata. Theor. Comput. Sci. 345, 1, 27--59.

Digital Library

[36]

Mathur, A., Dasdan, A., and Gupta, R. K. 1998. Rate analysis for embedded systems. ACM Trans. Des. Autom. Electron. Syst. 3, 3, 408--436.

Digital Library

[37]

McMillan, K. L. and Dill, D. L. 1992. Algorithms for interface timing verification. In IEEE International Conference on Computer Design. IEEE Computer Society, 48--51.

Digital Library

[38]

Møller, J. B., Lichtenberg, J., Andersen, H. R., and Hulgaard, H. 1999. Difference decision diagrams. In International Workshop on Computer Science Logic (CSL'99), J. Flum and M. Rodríguez-Artalejo, Eds. Lecture Notes in Computer Science, vol. 1683. Springer, 111--125.

Digital Library

[39]

Moore, S. K. 2006. Winner: Multimedia monster. IEEE Spectrum. 43, 1, 20--23.

Digital Library

[40]

OMG. 2006. UML resource page. http://www.uml.org/#Links-UML2Tools.

[41]

OMG, T. O. M. G. 2005. Unified modeling language: Superstructure, version 2.0. Tech. rep. formal/05-07-04. August.

[42]

Pop, P., Eles, P., Peng, Z., and Pop, T. 2006. Analysis and optimization of distributed real-time embedded systems. ACM Trans. Des. Autom. Electron. Syst. 11, 3, 593--625.

Digital Library

[43]

Sawitzki, D. 2004. Experimental studies of symbolic shortest-path algorithms. In Workshop on Experimental Algorithms (WEA'04), C. C. Ribeiro and S. L. Martins, Eds. Lecture Notes in Computer Science, vol. 3059. Springer, 482--497.

[44]

Somenzi, F. 2006. CUDD:CU Decision Diagram Package, Release 2.4.1.

[45]

Stehno, C. 2002. Real-Time systems design with PEP. In Tools and Algorithms for Construction and Analysis of Systems, 476--480.

Digital Library

[46]

Wang, F., Wu, R.-S., and Huang, G.-D. 2005. Verifying timed and linear hybrid rule-systems with red. In International Conference on Software Engineering and Knowledge Engineering (SEKE'05), W. C. Chu, N. J. Juzgado, and W. E. Wong, Eds. 448--454.

[47]

Yen, T.-Y., Ishii, A., Casavant, A. E., and Wolf, W. 1998. Efficient algorithms for interface timing verification. Formal Methods Syst. Des. 12, 3, 241--265.

Digital Library

[48]

Zennou, S., Yguel, M., and Niebert, P. 2003. Else: A new symbolic state generator for timed automata. See Larsen and Niebert {2003}, 273--280.

[49]

Zuberek, W. M. 1980. Timed petri nets and preliminary performance evaluation. In Proceedings of the 7th Annual Symposium on Computer Architecture (ISCA '80). ACM Press, New York, 88--96.

Digital Library

Cited By

Zompakis NRodopoulos DNoltsis MCatthoor FSoudris DCatthoor FBasten TZompakis NGeilen MKjeldsberg P(2019)System Scenario Application to Dependable System DesignSystem-Scenario-based Design Principles and Applications10.1007/978-3-030-20343-6_7(127-144)Online publication date: 17-Sep-2019
https://doi.org/10.1007/978-3-030-20343-6_7
Zompakis NPapanikolaou ARaghavan PSoudris DCatthoor F(2012)Enabling Efficient System Configurations for Dynamic Wireless Applications Using System ScenariosInternational Journal of Wireless Information Networks10.1007/s10776-012-0197-x20:2(140-156)Online publication date: 23-Oct-2012
https://doi.org/10.1007/s10776-012-0197-x
Das DChakrabarti PKumar R(2010)Thermal analysis of multiprocessor SoC applications by simulation and verificationACM Transactions on Design Automation of Electronic Systems10.1145/1698759.169876515:2(1-52)Online publication date: 2-Mar-2010
https://dl.acm.org/doi/10.1145/1698759.1698765

Index Terms

Scenario-based timing verification of multiprocessor embedded applications
1. Computer systems organization
  1. Embedded and cyber-physical systems
  2. Real-time systems
2. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
      1. Formal software verification
  2. Software organization and properties
    1. Software functional properties
      1. Formal methods

Recommendations

Compositional verification of timing constraints for embedded real-time systems
ACOS'07: Proceedings of the 6th Conference on WSEAS International Conference on Applied Computer Science - Volume 6

In real-time software, not only computation errors but also timing errors can cause system failures, which eventually result in significant physical damages or threats to human life. To efficiently guarantee the timely execution of expected functions, ...
A symbolic-simulation approach to the timing verification of interacting FSMs
ICCD '95: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors

A timing verifier that scales to verify complex sequential circuits, modeled in terms of interacting FSMs, while rejecting false sequential and combinational paths has, so far, not been developed. We present an algorithm for this purpose. The inherently ...
Achieving Glitch-Free Clock Domain Crossing Signals Using Formal Verification, Static Timing Analysis, and Sequential Equivalence Checking
MTV '11: Proceedings of the 2011 12th International Workshop on Microprocessor Test and Verification

Current System-on-a-chip (SoC) designs contain increased levels of functional and structural complexities within a single system. With the integration of multiple designs, various clock domains are introduced. In this paper, we present a solution for ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Design Automation of Electronic Systems

ACM Transactions on Design Automation of Electronic Systems Volume 14, Issue 3

May 2009

376 pages

ISSN:1084-4309

EISSN:1557-7309

DOI:10.1145/1529255

Issue’s Table of Contents

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

ACM Journals for the Design of Smart and Connected Systems

Publication History

Published: 04 June 2009

Accepted: 01 January 2009

Revised: 01 November 2008

Received: 01 December 2007

Published in TODAES Volume 14, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
339
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zompakis NRodopoulos DNoltsis MCatthoor FSoudris DCatthoor FBasten TZompakis NGeilen MKjeldsberg P(2019)System Scenario Application to Dependable System DesignSystem-Scenario-based Design Principles and Applications10.1007/978-3-030-20343-6_7(127-144)Online publication date: 17-Sep-2019
https://doi.org/10.1007/978-3-030-20343-6_7
Zompakis NPapanikolaou ARaghavan PSoudris DCatthoor F(2012)Enabling Efficient System Configurations for Dynamic Wireless Applications Using System ScenariosInternational Journal of Wireless Information Networks10.1007/s10776-012-0197-x20:2(140-156)Online publication date: 23-Oct-2012
https://doi.org/10.1007/s10776-012-0197-x
Das DChakrabarti PKumar R(2010)Thermal analysis of multiprocessor SoC applications by simulation and verificationACM Transactions on Design Automation of Electronic Systems10.1145/1698759.169876515:2(1-52)Online publication date: 2-Mar-2010
https://dl.acm.org/doi/10.1145/1698759.1698765

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents