Probabilistic KLAIM

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2949, Issue , 2004, Pages 119-134

  Di Pierro, Alessandra ^a   Hankin, Chris ^b   Wiklicky, Herbert ^b  

^a UNIVERSITY OF PISA   (Italy)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; MARKOV PROCESSES; SEMANTICS;

CONTINUOUS TIME MARKOV PROCESS; CONTINUOUS-TIME; NEIGHBOURHOOD; OPERATIONAL SEMANTICS; POISSON PROCESS; PROBABILISTIC EXTENSION; PROBABILISTIC MODELING;

CONTINUOUS TIME SYSTEMS;

EID: 35048831795     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24634-3_11     Document Type: Article

References (17)

1. De Nicola, R., Ferrari, G., Pugliese, R.: KLAIM: A kernel language for agents interaction and mobility. IEEE Transactions on Software Engineering 24 (1998) 315-330
2. Morris, J.: Markov Chains. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge (1997)
3. Bause, F., Kritzinger, P. S.; Stochastic Petri Nets - An Introduction to the Theory. second edn. Vieweg Verlag (2002)
4. Tijms, H. C.: Stochastic Models - An Algorithmic Approach. John Wiley & Sons, Chichester (1994)
5. Di Pierro, A., Hankin, C., Wiklicky, H.: Analysing the propagation of computer viruses. Journal of Functional Programming (2003) (submitted).
6. Giacalone, A., Jou, C. C., Smolka, S.: Algebraic reasoning for probabilistic concurrent systems. In: Proceedings of the IFIP WG 2.2/2.3 Working Conference on Programming Concepts and Methods, North-Holland (1990) 443-458
7. Jonsson, B., Yi, W., Larsen, K.: 11. In: Probabilistic Extentions of Process Algebras. Elsevier Science, Amsterdam (2001) 685-710 see [17].
8. Di Pierro, A., Wiklicky, H.: Quantitative observables and averages in Probabilistic Concurrent Constraint Programming. In: New Trends in Constraints. Number 1865 in Lecture Notes in Computer Science, Springer Verlag (2000)
9. Hillston, J.: PEPA: Performance enhanced process algebra. Technical Report CSR-24-93, University of Edinburgh, Edinburgh, Scotland (1993)
10. Priami, C.: Stochastic π-calculus. Computer Journal 38 (1995) 578-589
11. Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press (1996)
12. Bernardo, M., Gorrieri, R.: A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time. Technical Report UBLCS-96-17, Department of Computer Science, University of Bologna (1997)
13. Kwiatkowska, M., Norman, G., Parker, D.: Probabilistic symbolic model checking with PRISM: A hybrid approach. In Katoen, J. P., Stevens, P., eds.: Proceedings of TACAS'02. Volume 2280 of Lecture Notes in Computer Science., Springer Verlag (2002) 52-66
14. de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, Department of Computer Science (1998)
15. Di Pierro, A., Hankin, C., Wiklicky, H.: Approximate Non-interference. Journal of Computer Security 12 (2004) 37-81
16. Aldini, A., Bravetti, M., Gorrieri, R.: A process algebraic approach for the analysis of probabilistic non-interference. Journal of Computer Security (2004)
17. Bergstra, J., Ponse, A., Smolka, S., eds.: Handbook of Process Algebra. Elsevier Science, Amsterdam (2001)