Skip to main content
SpringerLink
Log in

Analyzing Quantitative Transition Systems

  • Conference paper
  • First Online:
Quantitative Logic and Soft Computing 2016

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 510))

  • 551 Accesses

Abstract

During the past years, substantial progress has been made towards developing quantitative formal verification methods. In this paper, we establish a lattice-valued relation between the states of a quantitative transition system(QTS), called lattice-valued language containment relation, to measure to what extent the language of one state is included by that of the other. We study the relationship between lattice-valued language containment relation and two lattice-valued versions of similarity defined previously, and we explore the properties of compositionality of the lattice-valued language containment relation. These properties suggest that our language containment relation provides an appropriate basis for a quantitative theory of concurrent and distributed systems.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

References

  1. Bělohlávek, R.: Fuzzy Relational Systems: Foundations and Principles. Kluwer, New York (2002)

    Book  MATH  Google Scholar 

  2. Cao, Y.: Reliability of mobile processes with noisy channels. IEEE Trans. Comput. 61(9), 1217–1230 (2012)

    Article  MathSciNet  Google Scholar 

  3. Cao, Y., Sun, S., Wang, H., Chen, G.: A behavioral distance for fuzzy-transition systems. IEEE Trans. Fuzzy Syst. 21(4), 735–747 (2013)

    Article  Google Scholar 

  4. Cerný, P., Henzinger, T.A., Radhakrishna, A.: Simulation distances. Theor. Comput. Sci. 413(1), 21–35 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ćirić, M., Ignjatović, J., Damljanović, N., et al.: Bisimulations for fuzzy automata. Fuzzy Sets Syst. 186, 100–139 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ćirić, M., Ignjatović, J., Jancic, I., et al.: Computation of the greatest simulations and bisimulations between fuzzy automata. Fuzzy Sets Syst. 208, 22–42 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. De Alfaro, L., Faella, M., Stoelinga, M.: Linear and branching system metrics. IEEE Trans. Softw. Eng. 35(2), 258–273 (2009)

    Article  MATH  Google Scholar 

  8. Fahrenberg, U., Legay, A.: The quantitative linear-time-branching-time spectrum. Theor. Comput. Sci. 538, 54–69 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  9. Girard, A., Pappas, G.J.: Approximation metrics for discrete and continuous systems. IEEE Trans Autom. Control 52(5), 782–798 (2007)

    Article  MathSciNet  Google Scholar 

  10. Henzinger, T.A.: Quantitative reactive modeling and verification. Comput. Sci. Res. Dev. 28(4), 331–344 (2013)

    Article  Google Scholar 

  11. Julius, A.A., D’Innocenzo, A., DiBenedetto, M.D., et al.: Approximate equivalence and synchronization of metric transition systems. Syst. Control Lett. 58, 94–101 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kupferman, O., Lustig, Y.: Lattice automata. In: Proceedings of VWCAI2007. LNCS, vol. 4349, pp. 199–213 (2007)

    Google Scholar 

  13. Kupferman, O., Lustig, Y.: Latticed simulation relations and games. Int. J. Found. Comput. Sci. 21(2), 167–189 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  14. Pan, H., Cao, Y., Zhang, M., Chen, Y.: Simulation for lattice-valued doubly labeled transition systems. Int. J. Appox. Reason. 55, 797–811 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  15. Pan, H., Zhang, M., Wu, H., Chen, Y.: Quantitative analysis of lattice-valued Kripke structures. Fundam. Inform. 135(3), 269–293 (2014)

    MathSciNet  MATH  Google Scholar 

  16. Pan, H., Li, Y., Cao, Y.: Lattice-valued simulations for quantitative transition systems. Int. J. Approx. Reason. 56, 28–42 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  17. Qiu, D.: Automata theory based on completed residuated lattice-valued logic (I) and (II). Sci. China Ser. F 44, 419–429 (2001); 45, 442–452 (2002)

    Google Scholar 

  18. Thrane, C.R., Fahrenberg, U., Larsen, K.G.: Quantitative analysis of weighted transition systems. J. Log. Algebr. Program. 79(7), 689–703 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  19. Van Glabbeek, R.J.: The linear time-branching time spectrum. I: The semantics of concrete, sequential processes. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 3–99. Elsevier, Amsterdam (2001)

    Chapter  Google Scholar 

  20. Zhang, J., Zhu, Z.: A behavioural pseudometric based on \(\lambda \)-bisimilarity. Electron. Notes Theor. Comput. Sci. 220, 115–127 (2008)

    Article  MATH  Google Scholar 

  21. Zhang, J., Zhu, Z.: Characterize branching distance in terms of \((\eta,\,\alpha )\)-bisimilarity. Inf. Comput. 206, 953–965 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This research is partly supported by National Natural Science Foundation of China under Grant 11401361, by China Postdoctoral Science Foundation under Grant 2014M552408, and by Natural Science promotion plan Foundation of Anhui Provincial Education Department under Grant TSKJ2016B02.

Author information

Authors and Affiliations

  1. College of Computer and Information, Anhui Polytechnical University, Wuhu, 241000, China

    Guo-Wu Wang

  2. Key Laboratory of Computer Application Technology, Anhui Polytechnical University, Wuhu, 241000, China

    Guo-Wu Wang

  3. College of Computer Science and Technology, Taizhou University, Taizhou, 225300, China

    Ying-Xiong Shen & Hai-Yu Pan

  4. College of Computer Science, Shaanxi Normal University, Xi’an, 710062, China

    Hai-Yu Pan

Authors
  1. Guo-Wu Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ying-Xiong Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hai-Yu Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hai-Yu Pan .

Editor information

Editors and Affiliations

  1. Zhejiang, Zhejiang Sci-Tech University Zhejiang, Hangzhou, China

    Tai-He Fan

  2. Fujian, Jimei University Fujian, Xiamen, China

    Shui-Li Chen

  3. Zhejiang, Zhejiang Sci-Tech University Zhejiang, Hangzhou, China

    San-Min Wang

  4. Yanta, Shaanxi Normal University Yanta, Xi’an, China

    Yong-Ming Li

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing Switzerland

About this paper

Cite this paper

Wang, GW., Shen, YX., Pan, HY. (2017). Analyzing Quantitative Transition Systems. In: Fan, TH., Chen, SL., Wang, SM., Li, YM. (eds) Quantitative Logic and Soft Computing 2016. Advances in Intelligent Systems and Computing, vol 510. Springer, Cham. https://doi.org/10.1007/978-3-319-46206-6_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46206-6_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46205-9

  • Online ISBN: 978-3-319-46206-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation