Markov two-components processes

From MaRDI portal
Publication:2838243

DOI10.2168/LMCS-9(2:14)2013zbMATH Open1297.68180arXiv1305.5239OpenAlexW3104702572MaRDI QIDQ2838243FDOQ2838243


Authors: Samy Abbes Edit this on Wikidata


Publication date: 9 July 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Abstract: We propose Markov two-components processes (M2CP) as a probabilistic model of asynchronous systems based on the trace semantics for concurrency. Considering an asynchronous system distributed over two sites, we introduce concepts and tools to manipulate random trajectories in an asynchronous framework: stopping times, an Asynchronous Strong Markov property, recurrent and transient states and irreducible components of asynchronous probabilistic processes. The asynchrony assumption implies that there is no global totally ordered clock ruling the system. Instead, time appears as partially ordered and random. We construct and characterize M2CP through a finite family of transition matrices. M2CP have a local independence property that guarantees that local components are independent in the probabilistic sense, conditionally to their synchronization constraints. A synchronization product of two Markov chains is introduced, as a natural example of M2CP.


Full work available at URL: https://arxiv.org/abs/1305.5239




Recommendations





Cited In (7)





This page was built for publication: Markov two-components processes

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