DocumentCode :
2067217
Title :
On Probabilistic Automata in Continuous Time
Author :
Eisentraut, Christian ; Hermanns, Holger ; Zhang, Lijun
Author_Institution :
Comput. Sci., Saarland Univ., Saarbrucken, Germany
fYear :
2010
fDate :
11-14 July 2010
Firstpage :
342
Lastpage :
351
Abstract :
We develop a compositional behavioural model that integrates a variation of probabilistic automata into a conservative extension of interactive Markov chains. The model is rich enough to embody the semantics of generalised stochastic Petri nets. We define strong and weak bisimulations and discuss their compositionality properties. Weak bisimulation is partly oblivious to the probabilistic branching structure, in order to reflect some natural equalities in this spectrum of models. As a result, the standard way to associate a stochastic process to a generalised stochastic Petri net can be proven sound with respect to weak bisimulation.
Keywords :
Markov processes; Petri nets; bisimulation equivalence; probabilistic automata; semantic networks; bisimulation; compositional behavioural model; continuous time; generalised stochastic Petri net semantics; interactive Markov chains; probabilistic automata; Automata; Concurrent computing; Delay; Markov processes; Petri nets; Probabilistic logic; Markov processes; continuous time; discrete time; nondeterminism; process algebra; weak bisimulation semantics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Logic in Computer Science (LICS), 2010 25th Annual IEEE Symposium on
Conference_Location :
Edinburgh
ISSN :
1043-6871
Print_ISBN :
978-1-4244-7588-9
Electronic_ISBN :
1043-6871
Type :
conf
DOI :
10.1109/LICS.2010.41
Filename :
5571733
Link To Document :
بازگشت