Skip to main content
SpringerLink
Log in

About One Efficient Algorithm for Reachability Checking in Modeling and Its Implementation

  • Conference paper
ICT in Education, Research, and Industrial Applications (ICTERI 2012)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 347))

  • 605 Accesses

Abstract

The problem of reachability of states of transition systems is considered hereby. The notions of partial unfolding and permutability of two operators (including the notion of statically permutable operators) are presented. New algorithm for reachability problem in terms of insertion modeling, and implementation of this algorithm are described. An example of application of the proposed algorithm is considered.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Symbolic modeling, http://en.wikipedia.org/wiki/Model_checking

  2. Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communications. Information and Control 60, 109–137 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  3. Letichevsky, A., Kapitonova, J., Volkov, V., Letichevsky Jr., A., Baranov, S., Kotlyarov, V., Weigert, T.: System Specification with Basic Protocols. Cybernetics and System Analysis 4, 3–21 (2005)

    Google Scholar 

  4. Lomuscio, A., Penczek, W., Qu, H.: Partial Order Reductions for Model Checking Temporal-epistemic Logics over Interleaved Multi-agent Systems. Fundam. Inf. 101, 71–90 (2010)

    MathSciNet  MATH  Google Scholar 

  5. Ip, C.N., Dill, D.L.: Better verification through symmetry. Methods Syst. Des. 9, 41–75 (1996)

    Article  Google Scholar 

  6. Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. ACM Trans. Program. Lang. Syst. 16, 1512–1542 (1994)

    Article  Google Scholar 

  7. D’silva, V., Purandare, M., Kroening, D.: Approximation Refinement for Interpolation-Based Model Checking. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol. 4905, pp. 68–82. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. APS & IMS Systems, http://apsystem.org.ua

  9. Escobar, S., Meseguer, J.: Symbolic Model Checking of Infinite-State Systems Using Narrowing. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 153–168. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Herbreteau, F., Sutre, G., Tran, T.Q.: Unfolding Concurrent Well-Structured Transition Systems. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 706–720. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. McMillan, K.L.: Trace Theoretic Verification of Asynchronous Circuits Using Unfoldings. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939, pp. 180–195. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  12. Esparza, J., Heljanko, K.: Unfoldings - A Partial-Order Approach to Model Checking. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  13. Letichevsky, A., Gilbert, D.: A Model for Interaction of Agents and Environments. In: Bert, D., Choppy, C., Mosses, P.D. (eds.) WADT 1999. LNCS, vol. 1827, pp. 311–328. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Letichevsky, A.: Algebra of behavior transformations and its applications. In: Kudryavtsev, V.B., Rosenberg, I.G. (eds.) Structural Theory of Automata, Semigroups, and Universal Algebra. NATO Science Series II. Mathematics, Physics and Chemistry, vol. 207, pp. 241–272. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. Letichevsky, A., Kapitonova, J., Kotlyarov, V., Letichevsky Jr., A., Nikitchenko, N., Volkov, V., Weigert, T.: Insertion modeling in distributed system design. Problems of Programming 4, 13–39 (2008)

    Google Scholar 

  16. Letichevsky, A.A., Godlevsky, A.B., Letichevsky Jr., A.A., Potienko, S.V., Peschanenko, V.S.: Properties of Predicate Transformer of VRS System. Cybernetics and System Analyses 4, 3–16 (2010)

    Google Scholar 

  17. Letichevsky, A.A., Letychevskyi, O.A., Peschanenko, V.S.: Insertion Modeling System. In: Clarke, E., Virbitskaite, I., Voronkov, A. (eds.) PSI 2011. LNCS, vol. 7162, pp. 262–273. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  18. Letichevsky, A.A., Kapitonova, J.V.: Algebraic Programming in the APS System. In: International Symposium on Symbolic and Algebraic Computation, pp. 68–75. ACM, New York (1990)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Glushkov Institute of Cybernetics of NAS of Ukraine, 40 Glushkova ave., Kyiv, Ukraine

    Alexander Letichevsky & Olexander Letychevskyi

  2. Kherson State University, 27, 40 Rokiv Zhovtnya str., Kherson, Ukraine

    Vladimir Peschanenko

Authors
  1. Alexander Letichevsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olexander Letychevskyi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vladimir Peschanenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information Technologies, Zaporozhye National University, 66 Zhukovskogo st, 69600, Zaporozhye, Ukraine

    Vadim Ermolayev

  2. Mayr Application Engineering, Alpen-Adria University Klagenfurt, Universitätsstrasse 65, 9020, Klagenfurt, Austria

    Heinrich C. Mayr

  3. Department of Theory and Technology of Programming, National Taras Shevchenko University of Kyiv, 64, Volodymyrska Street, 01033, Kyiv, Ukraine

    Mykola Nikitchenko

  4. Kherson State University, 40-rokiv, Zhovtnya st. 27, 73000, Kherson, Ukraine

    Aleksander Spivakovsky

  5. School of Mathematics and Mechanics, Karazin Kharkiv National University, 4 Svobody Sqr, 61022, Kharkov, Ukraine

    Grygoriy Zholtkevych

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Letichevsky, A., Letychevskyi, O., Peschanenko, V. (2013). About One Efficient Algorithm for Reachability Checking in Modeling and Its Implementation. In: Ermolayev, V., Mayr, H.C., Nikitchenko, M., Spivakovsky, A., Zholtkevych, G. (eds) ICT in Education, Research, and Industrial Applications. ICTERI 2012. Communications in Computer and Information Science, vol 347. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35737-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35737-4_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35736-7

  • Online ISBN: 978-3-642-35737-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation