A linear process-algebraic format for probabilistic systems with data

Proceedings - International Conference on Application of Concurrency to System Design, ACSD

Volumn , Issue , 2010, Pages 213-222

  Katoeny, Joost Pieter ^b   Van De Pol, Jaco ^a   Stoelinga, Marïelle ^a   Timmer, Mark ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Datadependent probabilistic choice; Linearisation; Probabilistic process algebra; Symbolic transformations

Indexed keywords

LINEAR PROCESS; LINEARISATION; PROBABILISTIC AUTOMATA; PROBABILISTIC BISIMULATIONS; PROBABILISTIC CHOICES; PROBABILISTIC PROCESS ALGEBRA; PROBABILISTIC SYSTEMS; PROCESS ALGEBRAS; SYMBOLIC ANALYSIS; SYMBOLIC TRANSFORMATIONS;

MATHEMATICAL TRANSFORMATIONS; METADATA;

LINEAR TRANSFORMATIONS;

EID: 77957582774     PISSN: 15504808     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSD.2010.15     Document Type: Conference Paper

References (30)

1. J. Groote and A. Ponse, "The syntax and semantics of μCRL" in Proc. of Algebra of Communicating Processes, ser. Workshops in Computing, 1995, pp. 26-62.
2. http://www.prismmodelchecker.org/.
3. C. Baier, F. Ciesinski, and M. Größer, "PROBMELA: a modeling language for communicating probabilistic processes," in Proc. of the 2nd ACM/IEEE Int. Conf. on Formal Methods and Models for Co-Design (MEMOCODE), 2004, pp. 57-66.
4. H. Bohnenkamp, P. D'Argenio, H. Hermanns, and J.-P. Katoen, "MODEST: A compositional modeling formalism for hard and softly timed systems," IEEE Transactions of Software Engineering, vol. 32, no. 10, pp. 812-830, 2006.
5. P. D'Argenio, B. Jeannet, H. Jensen, and K. Larsen, "Reachability analysis of probabilistic systems by successive refinements," in Proc. of the Joint Int. Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM-PROBMIV), ser. LNCS, vol. 2165, 2001, pp. 39-56.
6. L. de Alfaro and P. Roy, "Magnifying-lens abstraction for Markov decision processes," in Proc. of the 19th Int. Conf. on Computer Aided Verification (CAV), ser. LNCS, vol. 4590, 2007, pp. 325-338.
7. T. Henzinger, M. Mateescu, and V. Wolf, "Sliding window abstraction for infinite Markov chains," in Proc. of the 21st Int. Conf. on Computer Aided Verification (CAV), ser. LNCS, vol. 5643, 2009, pp. 337-352.
8. J.-P. Katoen, D. Klink, M. Leucker, and V. Wolf, "Threevalued abstraction for continuous-time Markov chains," in Proc. of the 19th Int. Conf. on Computer Aided Verification (CAV), ser. LNCS, vol. 4590, 2007, pp. 311-324.
9. M. Kwiatkowska, G. Norman, and D. Parker, "Game-based abstraction for Markov decision processes," in Proc. of the 3rd Int. Conf. on Quantitative Evaluation of Systems (QEST), 2006, pp. 157-166.
10. H. Hermanns, B. Wachter, and L. Zhang, "Probabilistic CEGAR," in Proc. of the 20th Int. Conf. on Computer Aided Verification (CAV), ser. LNCS, vol. 5123, 2008, pp. 162-175.
11. M. Kattenbelt, M. Kwiatkowska, G. Norman, and D. Parker, "Abstraction refinement for probabilistic software," in Proc. of the 19th Int. Conf. on Verification, Model Checking, and Abstract Interpretation (VMCAI), ser. LNCS, vol. 5403, 2009, pp. 182-197.
12. J. Hurd, A. McIver, and C. Morgan, "Probabilistic guarded commands mechanized in HOL," Theoretical Computer Science, vol. 346, no. 1, pp. 96-112, 2005. (Pubitemid 41606836)
13. M. Bezem and J. Groote, "Invariants in process algebra with data," in Proc. of the 5th Int. Conf. on Concurrency Theory (CONCUR), ser. LNCS, vol. 836, 1994, pp. 401-416.
14. K. Larsen and A. Skou, "Bisimulation through probabilistic testing," Information and Computation, vol. 94, no. 1, pp. 1-28, 1991.
15. D. Bosscher and A. Ponse, "Translating a process algebra with symbolic data values to linear format," in Proc. of the 1st Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), ser. BRICS Notes Series, vol. NS-95-2, 1995, pp. 119-130.
16. Y. Usenko, "Linearization in -CRL," Ph.D. dissertation, Eindhoven University of Technology, 2002.
17. J. Groote and J. Springintveld, "Focus points and convergent process operators: a proof strategy for protocol verification," Journal of Logic and Algebraic Programming, vol. 49, no. 1-2, pp. 31-60, 2001.
18. W. Fokkink, J. Pang, and J. van de Pol, "Cones and foci: A mechanical framework for protocol verification," Formal Methods in System Design, vol. 29, no. 1, pp. 1-31, 2006.
19. J. Groote and B. Lisser, "Computer assisted manipulation of algebraic process specifications," CWI, Tech. Rep. SENR0117, 2001.
20. J. van de Pol and M. Timmer, "State space reduction of linear processes using control flow reconstruction," in Proc. of the 7th Int. Symp. on Automated Technology for Verification and Analysis (ATVA), ser. LNCS, vol. 5799, 2009, pp. 54-68.
21. M. Espada and J. van de Pol, "An abstract interpretation toolkit for -CRL," Formal Methods in System Design, vol. 30, no. 3, pp. 249-273, 2007.
22. S. Blom, B. Lisser, J. van de Pol, and M. Weber, "A database approach to distributed state-space generation," Journal of Logic and Computation, 2009, Advance Access, March 5.
23. S. Blom and J. van de Pol, "Symbolic reachability for process algebras with recursive data types," in Proc. of the 5th Int. Colloquium on Theoretical Aspects of Computing (ICTAC), ser. LNCS, vol. 5160, 2008, pp. 81-95.
24. J. Groote and R. Mateescu, "Verification of temporal properties of processes in a setting with data," in Proc. of the 7th Int. Conf. on Algebraic Methodology and Software Technology (AMAST), ser. LNCS, vol. 1548, 1998, pp. 74-90.
25. J. Groote and T. Willemse, "Model-checking processes with data," Science of Computer Programming, vol. 56, no. 3, pp. 251-273, 2005.
26. S. Blom and J. van de Pol, "State space reduction by proving confluence," in Proc. of the 14th Int. Conf. on Computer Aided Verification (CAV), ser. LNCS, vol. 2404, 2002, pp. 596-609.
27. J.-P. Katoen, J. van de Pol, M. Stoelinga, and M. Timmer, "A linear process algebraic format for probabilistic systems with data (extended version)," TR-CTIT-10-11, CTIT, University of Twente, Tech. Rep., 2010.
28. R. Segala, "Modeling and verification of randomized distributed real-time systems," Ph.D. dissertation, Massachusetts Institute of Technology, 1995.
29. R. Milner, Communication and Concurrency. Prentice Hall, 1989.
30. W. Fokkink and J. Pang, "Variations on Itai-Rodeh leader election for anonymous rings and their analysis in PRISM," Journal of Universal Computer Science, vol. 12, no. 8, pp. 981-1006, 2006.