Abstract
In this paper we present pTiMo, a process algebra in which migrations and interactions depend upon timers and have probabilities. The semantics of the calculus is given in terms of labeled, discrete-time Markov chains. The existing quantitative tools do not explicitly support properties which make use of local clocks, multisets of transitions (generated by the maximal progress policy in pTiMo) and transition provenance (the location at which a transition originates, and the processes that participate in the transition). In order to study such properties, we introduce a probabilistic temporal logic PLTM for pTiMo, and provide an algorithm for verifying PLTM properties. These properties can be checked over states and/or transitions, and encompass both transient and steady-state behaviors. We also provide a verification algorithm for PLTM properties, and analyze its time complexity.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aman, B., Ciobanu, G., Koutny, M.: Behavioural Equivalences over Migrating Processes with Timers. In: Giese, H., Rosu, G. (eds.) FORTE/FMOODS 2012. LNCS, vol. 7273, pp. 52–66. Springer, Heidelberg (2012)
Berger, M.: Towards Abstractions For Distributed Systems. PhD thesis, Imperial College, Department of Computing (2002)
Ciobanu, G., Juravle, C.: A Software Platform for Timed Mobility and Timed Interaction. In: Lee, D., Lopes, A., Poetzsch-Heffter, A. (eds.) FMOODS/FORTE 2009. LNCS, vol. 5522, pp. 106–121. Springer, Heidelberg (2009)
Ciobanu, G., Koutny, M.: Timed mobility in process algebra and Petri nets. J. Log. Algebr. Program. 80(7), 377–391 (2011)
Ciobanu, G., Rotaru, A.: A Probabilistic Query Language for Migrating Processes with Timers. Technical Report FML-12-01, Formal Methods Laboratory, Institute of Computer Science, Romanian Academy (2012)
Ciobanu, G., Prisacariu, C.: Timers for distributed systems. Electron. Notes Theor. Comput. Sci. 164(3), 81–99 (2006)
De Nicola, R., Ferrari, G., Pugliese, R.: KLAIM: A Kernel Language for Agents Interaction and Mobility. IEEE T. Software Eng. 24(5), 315–329 (1998)
Feller, W.: An Introduction to Probability Theory and Its Applications, 3rd edn., vol. 1. Wiley (1968)
Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Form. Asp. Comput. 6(5), 512–535 (1994)
Hennessy, M.: A distributed π-calculus. Cambridge University Press (2007)
Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press (1996)
Huth, M.: The interval domain: a matchmaker for aCTL and aPCTL. Electron. Notes Theor. Comput. Sci. 14, 134–148 (1998)
Kwiatkowska, M., Norman, G., Parker, D.: Stochastic Model Checking. In: Bernardo, M., Hillston, J. (eds.) SFM 2007. LNCS, vol. 4486, pp. 220–270. Springer, Heidelberg (2007)
Sewell, P., et al.: Acute: High-Level Programming Language Design for Distributed Computation. J. Funct. Program. 17, 547–612 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ciobanu, G., Rotaru, A. (2013). A Probabilistic Logic for pTiMo. In: Liu, Z., Woodcock, J., Zhu, H. (eds) Theoretical Aspects of Computing – ICTAC 2013. ICTAC 2013. Lecture Notes in Computer Science, vol 8049. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39718-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-39718-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39717-2
Online ISBN: 978-3-642-39718-9
eBook Packages: Computer ScienceComputer Science (R0)