Zobrazeno 1 - 5
of 5
pro vyhledávání: '"EC Grant Agreement nr.: FP7/257005"'
Autor:
Katoen, Joost P.
Publikováno v:
24th International Conference on Concurrency Theory, CONCUR 2013, 44-45
STARTPAGE=44;ENDPAGE=45;TITLE=24th International Conference on Concurrency Theory, CONCUR 2013
STARTPAGE=44;ENDPAGE=45;TITLE=24th International Conference on Concurrency Theory, CONCUR 2013
Treating random phenomena in concurrency theory has a long tradition. Petri nets [18, 10] and process algebras [14] have been extended with probabilities. The same applies to behavioural semantics such as strong and weak (bi)simulation [1], and testi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::ff209f5a56a8df035689d858a21967e3
https://research.utwente.nl/en/publications/concurrency-meets-probability-theory-and-practice-abstract(f18633f6-ac0b-481b-8ab2-16509678472d).html
https://research.utwente.nl/en/publications/concurrency-meets-probability-theory-and-practice-abstract(f18633f6-ac0b-481b-8ab2-16509678472d).html
Autor:
Guck, Dennis, Hatefi, Hassan, Hermanns, H., Katoen, Joost P., Timmer, Mark, Joshi, K.R., Siegle, M., Stoelinga, Mariëlle Ida Antoinette, d' Argenio, P.R.
Publikováno v:
Proceedings of the 10th International Conference on Quantitative Evaluation of Systems (QEST), 55-71
STARTPAGE=55;ENDPAGE=71;TITLE=Proceedings of the 10th International Conference on Quantitative Evaluation of Systems (QEST)
Quantitative Evaluation of Systems ISBN: 9783642401954
QEST
STARTPAGE=55;ENDPAGE=71;TITLE=Proceedings of the 10th International Conference on Quantitative Evaluation of Systems (QEST)
Quantitative Evaluation of Systems ISBN: 9783642401954
QEST
Markov automata (MA) constitute an expressive continuous-time compositional modelling formalism. They appear as semantic backbones for engineering frameworks including dynamic fault trees, Generalised Stochastic Petri Nets, and AADL. Their expressive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5eff0e8be13b8d072d9172edc575b4a5
https://research.utwente.nl/en/publications/540e2b66-4a5c-46ed-b2f0-a837711397b5
https://research.utwente.nl/en/publications/540e2b66-4a5c-46ed-b2f0-a837711397b5
Markov automata (MA) constitute an expressive continuous-time compositional modelling formalism. They appear as semantic backbones for engineering frameworks including dynamic fault trees, Generalised Stochastic Petri Nets, and AADL. Their expressive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___00893::59034bd064af8e39f5b49560dee45cb5
http://arxiv.org/abs/1305.7050v1
http://arxiv.org/abs/1305.7050v1
Markov automata (MA) constitute an expressive continuous-time compositional modelling formalism. They appear as semantic backbones for engineering frameworks including dynamic fault trees, Generalised Stochastic Petri Nets, and AADL. Their expressive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::8072be2b54200679ead1717e9a424e9e
https://research.utwente.nl/en/publications/modelling-reduction-and-analysis-of-markov-automata-extended-version(592db5c4-a538-467b-967a-58febef04444).html
https://research.utwente.nl/en/publications/modelling-reduction-and-analysis-of-markov-automata-extended-version(592db5c4-a538-467b-967a-58febef04444).html
Publikováno v:
24th International Conference on Concurrency Theory, CONCUR 2013. :44-45
Treating random phenomena in concurrency theory has a long tradition. Petri nets [18, 10] and process algebras [14] have been extended with probabilities. The same applies to behavioural semantics such as strong and weak (bi)simulation [1], and testi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___00893::b6587dd330a991c1846b69f642cdc198
https://doi.org/10.1007/978-3-642-40184-8_4
https://doi.org/10.1007/978-3-642-40184-8_4
