Bisimulation for Feller-Dynkin Processes
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2019
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911766948085760 |
|---|---|
| author | Chen, Linan Clerc, Florence Panangaden, Prakash |
| author_facet | Chen, Linan Clerc, Florence Panangaden, Prakash |
| contents | Bisimulation is a concept that captures behavioural equivalence. It has been studied extensively on nonprobabilistic systems and on discrete-time Markov processes and on so-called continuous-time Markov chains. In the latter time is continuous but the evolution still proceeds in jumps. We propose two definitions of bisimulation on continuous-time stochastic processes where the evolution is a \emph{flow} through time. We show that they are equivalent and we show that when restricted to discrete-time, our concept of bisimulation encompasses the standard discrete-time concept. The concept we introduce is not a straightforward generalization of discrete-time concepts. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1904_00976 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Bisimulation for Feller-Dynkin Processes Chen, Linan Clerc, Florence Panangaden, Prakash Logic in Computer Science Formal Languages and Automata Theory Probability Bisimulation is a concept that captures behavioural equivalence. It has been studied extensively on nonprobabilistic systems and on discrete-time Markov processes and on so-called continuous-time Markov chains. In the latter time is continuous but the evolution still proceeds in jumps. We propose two definitions of bisimulation on continuous-time stochastic processes where the evolution is a \emph{flow} through time. We show that they are equivalent and we show that when restricted to discrete-time, our concept of bisimulation encompasses the standard discrete-time concept. The concept we introduce is not a straightforward generalization of discrete-time concepts. |
| title | Bisimulation for Feller-Dynkin Processes |
| topic | Logic in Computer Science Formal Languages and Automata Theory Probability |
| url | https://arxiv.org/abs/1904.00976 |