Extended Markovian Process Algebra

DOI10.1007/3-540-61604-7_63zbMath1514.68155OpenAlexW1531089277MaRDI QIDQ6104380

Roberto Gorrieri, Marco Bernardo

Publication date: 28 June 2023

Published in: CONCUR '96: Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61604-7_63

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (8)

Comparative branching-time semantics for Markov chains ⋮ A compositional model to reason about end-to-end QoS in stochastic Reo connectors ⋮ An algebra-based method to associate rewards with EMPA terms ⋮ A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time ⋮ A process algebra framework for multi-scale modelling of biological systems ⋮ Bisimulation for probabilistic transition systems: A coalgebraic approach ⋮ A fluid analysis framework for a Markovian process algebra ⋮ Bisimulation and Simulation Relations for Markov Chains

Cites Work

• Bisimulation through probabilistic testing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extended Markovian Process Algebra