On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi

DOI10.1016/j.tcs.2014.10.025zbMath1302.68199OpenAlexW2166528301MaRDI QIDQ481103

Marco Bernardo

Publication date: 12 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.025

zbMATH Keywords

compositionalitycontinuous-time Markov chainsexactnesspseudo-aggregationsstochastic process algebraweak bisimulation equivalence

Mathematics Subject Classification ID

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 (4)

Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions ⋮ Proportional lumpability and proportional bisimilarity ⋮ Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC ⋮ Discrete time stochastic and deterministic Petri box calculus dtsdPBC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Palm probabilities and stationary queues
• Interactive Markov chains. And the quest for quantified quality
• CCS expressions, finite state processes, and three problems of equivalence
• Performance measure sensitive congruences for Markovian process algebras
• Timing and causality in process algebra
• Non-bisimulation-based Markovian behavioral equivalences
• Comparative branching-time semantics for Markov chains
• Weighted Lumpability on Markov Chains
• Simple O(m logn) Time Markov Chain Lumping
• Three Partition Refinement Algorithms
• Aggregation and disaggregation through insensitivity in stochastic Petri nets
• Sojourn times in finite Markov processes
• Exact and ordinary lumpability in finite Markov chains
• Branching time and abstraction in bisimulation semantics
• Behavioural abstraction in TCCS

This page was built for publication: On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi