Revisiting interactive Markov chains
From MaRDI portal
Applications of continuous-time Markov processes on discrete state spaces (60J28) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cites work
- scientific article; zbMATH DE number 1670867 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1304995 (Why is no real title available?)
- scientific article; zbMATH DE number 729460 (Why is no real title available?)
- scientific article; zbMATH DE number 2090712 (Why is no real title available?)
- scientific article; zbMATH DE number 1397300 (Why is no real title available?)
- A Compositional Approach to Performance Modelling
- A complete axiomatisation for observational congruence of finite-state behaviours
- A complete inference system for a class of regular behaviours
- A process algebra for timed systems
- On “Axiomatising Finite Concurrent Processes”
- Priority in process algebra.
- The algebra of timed processes, ATP: Theory and application
- The theory of interactive generalized semi-Markov processes
Cited in
(15)- Interactive Markov chains. And the quest for quantified quality
- Applying Formal Methods: Testing, Performance, and M/E-Commerce
- Lumping and reversed processes in cooperating automata
- Probabilistic weak simulation is decidable in polynomial time
- On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi
- Trace semantics for stochastic systems with nondeterminism
- A Tutorial on Interactive Markov Chains
- Axiomatizing maximal progress and discrete time
- YMCA: why Markov chain algebra?
- On the expressiveness of Markovian process calculi with durational and durationless actions
- Proportional lumpability and proportional bisimilarity
- Interactive infinite Markov particle systems with jumps
- Stochastic and Real Time in Process Algebra: A Conceptual Overview
- Extensions of standard weak bisimulation machinery: finite-state general processes, refinable actions, maximal-progress and time
- On the Minimisation of Acyclic Models
This page was built for publication: Revisiting interactive Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842864)
