Skip to main content
SpringerLink
Log in

Automatic generation of symbolic model for parameterized synchronous systems

  • Software Engineering
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

With the purpose of making the verification of parameterized system more general and easier, in this paper, a new and intuitive language PSL (Parameterized-system Specification Language) is proposed to specify a class of parameterized synchronous systems. From a PSL script, an automatic method is proposed to generate a constraint-based symbolic model. The model can concisely symbolically represent the collections of global states by counting the number of processes in a given state. Moreover, a theorem has been proved that there is a simulation relation between the original system and its symbolic model. Since the abstract and symbolic techniques are exploited in the symbolic model, state-explosion problem in traditional verification methods is efficiently avoided. Based on the proposed symbolic model, a reachability analysis procedure is implemented using ANSI C++ on UNIX platform. Thus, a complete tool for verifying the parameterized synchronous systems is obtained and tested for some cases. The experimental results show that the method is satisfactory.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Edmund M Clark, Jr Orna Grumberg, Doron A Peled. Model Checking. The MIT Press, 1998.

  2. Cheng K-T, Krishnakumar A S. Automatic generation of functional vectors using extended finite machine model.ACM Trans. Design Automation of Electronic Systems, 1996, 1(1): 57–79.

    Article  Google Scholar 

  3. Apt K, Kozen D. Limits for automatic verification of finite-state concurrent systems.Information Processing Letters, 1986, 15: 307–309.

    Article  MathSciNet  Google Scholar 

  4. German S M, Sistia A P. Reasoning about systems with many processes.JACM, 1992, 39(3): 675–735.

    Article  MATH  Google Scholar 

  5. Emerson E A, Namjoshi K S. On model checking for non-deterministic infinite-state system. InProc. 13th IEEE Int. Symp. Logic in Computer Science, 1998, pp. 70–80.

  6. Esparza J, Finkel A, Mayrz R. On the verification of broadcast protocols. InProc. 24th Annual Symp. Logic in Computer Science (LICS'99), Trento, Italy, 1999, pp. 352–359.

  7. Abdulla P A, Jonsson B. Ensuring completeness of symbolic verification methods for infinite state, system.Theoretical Computer Science, 2001, 256(1–2): 145–167.

    Article  MATH  MathSciNet  Google Scholar 

  8. Handy J. The Cache Memory Book. Academic Press, 1998.

  9. Delzanno G. On efficient data structures for the verification of parameterized synchronous systems. Tech. Rep. DISI-00-03, Dip. di Informatica e Scienze dell'Informazione, Universit a di Genova, January 2000.

  10. Abdulla P A, Gerans K, Jonsson B, Tsay Y K. General decidability theorems for infinite-state system. InProc. 10th IEEE Int. Symp. Logic in Computer Science, New Brunswick, New Jersey, 1996, pp. 313–321.

  11. Delzanno G, Podelski A. Model checking in CLP. InProc. 5th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), LNCS 1579, Amsterdam, Netherlands, 1999, pp. 223–239.

  12. Delzanno G. Automatic verification of parameterized cache coherence protocols. InComputer Aided Verification 12th International Conference 2000, LNCS 1855, Chicago, IL, USA, pp. 53–68.

  13. Delzanno G, Esparza J, Podelski A. Constraint-based analysis of broadcast protocols. InProc. Annual Conf. the European Association for Computer Science Logic (CSL'99), LNCS 1683, Madrid, Spain, 1999, pp. 50–66.

  14. lp-solve: A tool of hybrid linear programming. ftp://ftp.ics.ele.tue.nl/pub/lp_solve/.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Shanghai Jiaotong University, 200030, Shanghai, P.R. China

    Wei-Wen Xu

  2. Laboratory of Computer Science, Institute of Software, The Chinese Academy of Sciences, 100080, Beijing, P.R. China

    Wei-Wen Xu

Authors
  1. Wei-Wen Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei-Wen Xu.

Additional information

This work is supported in part by the National Natural, Science Foundation of China (Grant Nos. 60173103 and 60125207).

Wei-Wen Xu was born in 1975. She received the B.S. and M.S. degrees in computer science and technology from Harbin Science and Technology University in 1997 and 2000 respectively. Now she is a Ph.D. candidate in computer software and theory at Shanghal Jiaotong University. Her research interests include model checking and automatic verification.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, WW. Automatic generation of symbolic model for parameterized synchronous systems. J. Comput. Sci. & Technol. 19, 812–819 (2004). https://doi.org/10.1007/BF02973444

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02973444

Keywords

Search

Navigation