Comparative branching-time semantics for Markov chains (extended abstract)


Share/Save/Bookmark

Baier, Christel and Hermanns, Holger and Katoen, Joost-Pieter and Wolf, Verena (2003) Comparative branching-time semantics for Markov chains (extended abstract). In: 14th International Conference on Concurrency Theory, CONCUR 2003, September 3-5, 2003, Marseille, France (pp. pp. 492-507).

open access
[img]
Preview
PDF
321kB
Abstract:This paper presents various semantics in the branching-time spectrum of discrete-time and continuous-time Markov chains (DTMCs and CTMCs). Strong and weak bisimulation equivalence and simulation pre-orders are covered and are logically characterised in terms of the temporal logics PCTL and CSL. Apart from presenting various existing branching-time relations in a uniform manner, our contributions are: (i) weak simulation for DTMCs is defined, (ii) weak bisimulation equivalence is shown to coincide with weak simulation equivalence, (iii) logical characterisation of weak (bi)simulations are provided, and (iv) a classification of branching-time relations is presented, elucidating the semantics of DTMCs, CTMCs and their interrelation.
Item Type:Conference or Workshop Item
Copyright:© 2003 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/47300
Official URL:http://dx.doi.org/10.1007/978-3-540-45187-7_32
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 217628