Probabilistic KLAIM

DOI10.1007/978-3-540-24634-3_11MaRDI QIDQ5717720zbMATH OpenOpenAlexFDO

Authors Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b95570

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Probabilistic communicating processes
• A Probabilistic Applied Pi–Calculus
• On the expressive power of \textsc{Klaim}-based calculi
• Processes with probabilities, priority and time
• Probabilistic and prioritized models of timed CSP

Cited in

(6)

• Probabilistic mobile ambients
• Quantitative information in the tuple space coordination model
• Probabilistic semantics and program analysis
• Trace machines for observing continuous-time Markov chains
• Towards a logic for performance and mobility
• Formal techniques for performance analysis: blending SAN and PEPA

Describes a project that uses

Uses Software

• KLAIM

This page was built for publication: Probabilistic KLAIM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717720)