Cost Preserving Bisimulations for Probabilistic Automata
Probabilistic automata constitute a versatile and elegant model for concurrent probabilistic systems. They are equipped with a compositional theory supporting abstraction, enabled by weak probabilistic bisimulation serving as the reference notion for summarising the effect of abstraction. This paper...
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Logical Methods in Computer Science e.V.
2014-12-01
|
| Serie: | Logical Methods in Computer Science |
| Soggetti: | |
| Accesso online: | https://lmcs.episciences.org/1050/pdf |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|