Skip to main content
SpringerLink
Log in

Compositional Theories of Qualitative and Quantitative Behaviour

  • Conference paper
  • First Online:
Applications and Theory of Petri Nets 2003 (ICATPN 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2679))

Included in the following conference series:

  • 992 Accesses

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. L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In IEEE 13th Symp. on Logic in Comp. Sc., pp. 174–183, IEEE CS Press, 1998.

    Google Scholar 

  2. A. Aziz, K. Sanwal, V. Singhal and R. Brayton. Model checking continuous time Markov chains. ACM Transactions on Computational Logic, 1(1): 162–170, 2000.

    Article  MathSciNet  Google Scholar 

  3. J.A. Bergstra, A. Ponse, and S.A. Smolka, editors. Handbook of Process Algebra. Elsevier Science Publishers, 2001.

    Google Scholar 

  4. M. Bernardo and R. Gorrieri. Extended Markovian Process Algebra. In Ugo Montanari and Vladimiro Sassone, editors, CONCUR’96: Concurrency Theory (7th International Conference, Pisa, Italy, August 1996), volume 1119 of Lecture Notes in Computer Science. Springer, 1996.

    Google Scholar 

  5. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Found. of Softw. Technology and Th. Comp. Sc., LNCS 1026: 499–513, Springer, 1995.

    Google Scholar 

  6. C. Baier and M.Z. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distr. Comp., 11: 125–155, 1998.

    Article  Google Scholar 

  7. C. Baier, B.R. Haverkort, H. Hermanns and J.-P. Katoen. Model checking continuous-time Markov chains by transient analysis. In: E.A. Emerson and A.P. Sistla, Computer-Aided Verification, LNCS 1855: 358–372, 2000.

    Chapter  Google Scholar 

  8. C. Baier, J.-P. Katoen and H. Hermanns. Approximate symbolic model checking of continuous-time Markov chains. In J.C.M. Baeten and S. Mauw, Concurrency Theory, LNCS 1664: 146–162, 1999.

    Chapter  Google Scholar 

  9. P. Buchholz, J.-P. Katoen, P. Kemper and C. Tepper. Model-checking large structured Markov chains. Journal of Logic and Algebraic Programming, 2003 (to appear).

    Google Scholar 

  10. E. Brinksma and H. Hermanns. Process Algebra and Markov Chains. In [11], LNCS 2090: 183–231, 2001.

    Chapter  Google Scholar 

  11. E. Brinksma and H. Hermanns and J.-P. Katoen. Lectures on Formal Methods and Performance Analysis. LNCS 2090, 2001.

    MATH  Google Scholar 

  12. A. Cimatti, E. Clarke, F. Giunchiglia and M. Roveri. NuSMV: a new symbolic model checker. J. on Software Tools for Technology Transfer, 2: 410–425, 2000.

    Article  MATH  Google Scholar 

  13. E. Clarke, O. Grumberg and D. Peled. Model Checking. MIT Press, 1999.

    Google Scholar 

  14. E.M. Clarke and E.A. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic. In Logic of Programs, LNCS 131: 52–71, 1981.

    Chapter  Google Scholar 

  15. N. Götz, U. Herzog, and M. Rettelbach. Multiprocessor and Distributed System Design: The Integration of Functional Specification and Performance Analysis using Stochastic Process Algebras. In Performance’93, 1993.

    Google Scholar 

  16. J. Hillston. A Compositional Approach to Performance Modelling. PhD thesis, University of Edinburgh, 1994.

    Google Scholar 

  17. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs, NJ, 1985.

    MATH  Google Scholar 

  18. J.-P. Katoen and P.R. D’Argenio. General Distributions in Process Algebra. In [11], LNCS 2090: 375–430, 2001.

    Chapter  Google Scholar 

  19. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing 6: 512–535, 1994.

    Article  MATH  Google Scholar 

  20. H. Hermanns, J.-P. Katoen, J. Meyer-Kayser and M. Siegle. A Markov chain model checker. In S. Graf and M.I. Schwartzbach, Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1785: 347–362, 2000.

    Chapter  Google Scholar 

  21. G.J. Holzmann. The model checker Spin. IEEE Tr. on Softw. Eng., 23(5): 279–295, 1997.

    Article  MathSciNet  Google Scholar 

  22. H. Hermanns. Interactive Markov Chains. LNCS 2428, 2002.

    MATH  Google Scholar 

  23. M.Z. Kwiatkowska, G. Norman, and D. Parker. Probabilistic symbolic model checking with prism: A hybrid approach. In J-P. Katoen and P. Stevens (eds), Tools and Algorithms for the Construction and Analysis of Algorithms, LNCS 2280: 52–66, 2002

    Chapter  Google Scholar 

  24. R. Milner. Calculi for Synchrony and Asynchrony. Theoretical Computer Science, 25:269–310, 1983.

    Article  MathSciNet  Google Scholar 

  25. R. Milner. Communication and Concurrency. Prentice Hall, London, 1989.

    MATH  Google Scholar 

  26. G.D. Plotkin. A Structured Approach to Operational Semantics. Technical Report DAIMI FM-19, Computer Science Department, Aarhus University, 1981.

    Google Scholar 

  27. G.S. Shedler. Regenerative Stochastic Simulation. Academic Press, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Twente, PO Box 217, 7500AE, Enschede, Netherlands

    Ed Brinksma (Chair of Formal Methods and Tools)

Authors
  1. Ed Brinksma
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Technology and Management, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Wil M. P. van der Aalst

  2. Computer Science Department Parallel Systems Group, University of Oldenburg, 26111, Oldenburg, Germany

    Eike Best

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brinksma, E. (2003). Compositional Theories of Qualitative and Quantitative Behaviour. In: van der Aalst, W.M.P., Best, E. (eds) Applications and Theory of Petri Nets 2003. ICATPN 2003. Lecture Notes in Computer Science, vol 2679. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44919-1_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-44919-1_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40334-0

  • Online ISBN: 978-3-540-44919-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation