Revisiting interactive Markov chains
From MaRDI portal
Applications of continuous-time Markov processes on discrete state spaces (60J28) 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)
Recommendations
Cites work
- A complete axiomatisation for observational congruence of finite-state behaviours
- A complete inference system for a class of regular behaviours
- A Compositional Approach to Performance Modelling
- A process algebra for timed systems
- 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?)
- 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)- Probabilistic weak simulation is decidable in polynomial time
- Proportional lumpability and proportional bisimilarity
- Extensions of standard weak bisimulation machinery: finite-state general processes, refinable actions, maximal-progress and time
- Lumping and reversed processes in cooperating automata
- A Tutorial on Interactive Markov Chains
- On the Minimisation of Acyclic Models
- Interactive infinite Markov particle systems with jumps
- On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi
- On the expressiveness of Markovian process calculi with durational and durationless actions
- YMCA: why Markov chain algebra?
- Stochastic and Real Time in Process Algebra: A Conceptual Overview
- Applying Formal Methods: Testing, Performance, and M/E-Commerce
- Axiomatizing maximal progress and discrete time
- Trace semantics for stochastic systems with nondeterminism
- Interactive Markov chains. And the quest for quantified quality
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)
