Abstract
A key advantage of the Möbius modeling environment is the ease with which one can incorporate new modeling formalisms, model composition and connection methods, and model solution methods. In this paper, we describe a new state-level abstract functional interface (AFI) for Möbius that allows numerical solution methods to communicate with Möbius state-level models via the abstraction of a labeled transition system. This abstraction, and its corresponding implementation as a set of containers and iterators, yields an important separation of concerns: It is possible to treat separately the problem of representing large labeled transition systems, like generator matrices of continuous-time Markov chains, and the problem of analyzing these systems. For example, any numerical solver (e.g., Jacobi, SOR, or uniformization) that accesses a model through the Möbius state-level AFI can operate on a variety of state-space representations, including “on-the-fly,” disk-based, sparse-matrix, Kronecker, and matrix-diagram representations, without requiring that the implementation be changed to match the state-space representation. This abstraction thus avoids redundant implementations of solvers and state-generation techniques, eases research cooperation, and simplifies comparison of approaches as well as benchmarking. In addition to providing a formal definition of the Möbius state-level AFI, we illustrate its use on two state-space representations (a sparse matrix and a Kronecker representation) and two numerical solvers (Jacobi and SOR). With the help of this implementation and two example models, we demonstrate that the AFI provides the benefits of transparency while introducing only minor slowdowns in solution speed.
This material is based upon work supported in part by the National Science Foundation under Grant No. 9975019, by the Motorola Center for High-Availability System Validation at the University of Illinois (under the umbrella of the Motorola Communications Center), and by the DFG, Collaborative Research Centre 559.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Baier, J. P. Katoen, and H. Hermanns. Approximate symbolic model checking of continuous-time Markov chains. In Proc. Concurrency Theory (CONCUR’ 99), pages 146–162. Springer LNCS 1664, 1999.
M. Bernardo and R. Gorrieri. A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theoretical Computer Science, 202(1–2):1–54, Jul 1998.
M. Bozga and O. Maler. On the representation of probabilities over structured domains. In Proc. CAV‘99, Springer, LNCS 1633, pages 261–273, 1999.
P. Buchholz. Markovian process algebra: Composition and equivalence. In U. Herzog and M. Rettelbach, editors, Proc. of the 2nd Work. on Process Algebras and Performance Modelling, pages 11–30. Arbeitsberichte des IMMD, University of Erlangen, no. 27, 1994.
P. Buchholz. Hierarchical Markovian models: Symmetries and aggregation. Performance Evaluation, 22:93–110, 1995.
P. Buchholz. Structured analysis approaches for large Markov chains. Applied Numerical Mathematics, 31(4):375–404, 1999.
P. Buchholz, G. Ciardo, S. Donatelli, and P. Kemper. Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models. INFORMS J. on Computing, 12(3), 2000.
P. Buchholz, M. Fischer, and P. Kemper. Distributed steady state analysis using Kronecker algebra. In Proc. 3rd Int. Workshop on the Numerical Solution of Markov Chains (NSMC’99), pages 76–95, Zaragoza, Spain, Sept. 1999.
P. Buchholz and P. Kemper. Compact representations of probability distributions in the analysis of superposed GSPNs. In Proc. of the 9th Int. Workshop on Petri Nets and Perf. Models, pages 81–90, Aachen, Germany, 2001.
P. Buchholz, P. Kemper, and C. Tepper. New features in the APNN toolbox. In P. Kemper, editor, Tools of Aachen 2001, Int. Multiconference on Measurement, Modelling and Evaluation of Computer-communication Systems, Tech. report No. 760/2001. Universität Dortmund, FB Informatik, 2001.
G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. Stochastic well-formed coloured nets for symmetric modelling applications. IEEE Transactions on Computers, 42(11):1343–1360, Nov 1993.
G. Ciardo and A. Miner. A data structure for the efficient Kronecker solution of GSPNs. In Proc. of PNPM’99: 8th Int. Workshop on Petri Nets and Performance Models, pages 22–31, 1999.
G. Ciardo and K. S. Trivedi. A decomposition approach for stochastic reward net models. Performance Evaluation, 18(1):37–59, 1993.
G. Clark, T. Courtney, D. Daly, D. Deavours, S. Derisavi, J. M. Doyle, W. H. Sanders, and P. Webster. The Möbius modeling tool. In Proc. of the 9th Int. Workshop on Petri Nets and Performance Models, pages 241–250, Aachen, Germany, September 2001.
D. Deavours and W. H. Sanders. The Möbius execution policy. In Proc. of PNPM’01: 9th Int. Workshop on Petri Nets and Performance Models, pages 135–144, Aachen, Germany, 2001.
D. Deavours and W. H. Sanders. Möbius: Framework and atomic models. In Proc. of PNPM’01: 9th Int. Workshop on Petri Nets and Performance Models, pages 251–260, Aachen, Germany, 2001.
D. D. Deavours and W. H. Sanders. An efficient disk-based tool for solving very large Markov models. In Proceedings of the 9th Int. Conference on Modelling Techniques and Tools for Computer Performance Evaluation (TOOLS’ 97), pages 58–71, June 1997.
D. D. Deavours and W. H. Sanders. ‘On-the-fly’ solution techniques for stochastic Petri nets and extensions. IEEE Trans. on Software Eng., 24(10):889–902, 1998.
J. M. Doyle. Abstract model specification using the Möbius modeling tool. Master’s thesis, University of Illinois at Urbana-Champaign, January 2000.
P. Fernandes, B. Plateau, and W. J. Stewart. Efficient descriptor-vector multiplication in stochastic automata networks. JACM, 45(3):381–414, 1998.
J. C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu. CADP: A protocol validation and verification toolbox. In Proc. of the 8th Conference on Computer-Aided Verification, volume 1102 of LNCS, pages 437–440, New Brunswick, USA, August 1996.
S. Gilmore, J. Hillston, and M. Ribaudo. An efficient algorithm for aggregating PEPA models. Software Engineering, 27(5):449–464, 2001.
H. Hermanns, J. Meyer-Kayser, and M. Siegle. Multi terminal binary decision diagrams to represent and analyse continuous time Markov chains. In Proc. 3rd Int. Workshop on the Numerical Solution of Markov Chains, pages 188–207, Zaragoza, Spain, 1999.
H. Hermanns and M. Ribaudo. Exploiting symmetries in stochastic process algebras. In Proc. of ESM’98: 12th European Simulation Multiconference, 1998.
J. P. Katoen, M. Kwiatkowska, G. Norman, and D. Parker. Faster and symbolic CTMC model checking. In Proc. PAPM-PROBMIV’01, pages 23–38. Springer LNCS 2165, 2001.
P. Kemper. Numerical analysis of superposed GSPNs. IEEE Trans. on Software Eng., 22(9):615–628, Sep 1996.
W. Knottenbelt and P. G. Harrison. Distributed disk-based solution techniques for large Markov models. In Proc. of NSMC’99: 3rd International Meeting on the Numerical Solution of Markov Chains, Zaragoza, Spain, pages 58–75, 1999.
W.J. Knottenbelt. Generalised Markovian analysis of timed transition systems. Master’s thesis, University of Cape Town, Cape Town, South Africa, July 1996.
D. R. Musser, G. J. Derge, and A. Saini. STL Tutorial and Reference Guide, Second Edition: C++ Programming with the Standard Template Library. Addison-Wesley, Reading, MA, 2001.
W. H. Sanders. Integrated frameworks for multi-level and multi-formalism modeling. In Proceedings of PNPM’99: 8th Int. Workshop on Petri Nets and Performance Models, Zaragoza, Spain, pages 2–9, September 1999.
W. H. Sanders and J. F. Meyer. Reduced base model construction methods for stochastic activity networks. IEEE Journal on Selected Areas in Communications, 9(1):25–36, January 1991.
W. J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton University Press, 1994.
C. M. Woodside and Y. Li. Performance Petri net analysis of communications protocol software by delay-equivalent aggregation. In Proc. of the 4th Int. Workshop on Petri Nets and Performance Models, pages 64–73, 1991.
P. Ziegler and H. Szczerbicka. A structure based decomposition approach for GSPN. In Proc. of PNPM’95: 6th Int. Workshop on Petri Nets and Performance Models, pages 261–270, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Derisavi, S., Kemper, P., Sanders, W.H., Courtney, T. (2002). The Möbius State-Level Abstract Functional Interface. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds) Computer Performance Evaluation: Modelling Techniques and Tools. TOOLS 2002. Lecture Notes in Computer Science, vol 2324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46029-2_2
Download citation
DOI: https://doi.org/10.1007/3-540-46029-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43539-6
Online ISBN: 978-3-540-46029-9
eBook Packages: Springer Book Archive