Zobrazeno 1 - 10
of 54
pro vyhledávání: '"Divergence-sensitive branching bisimulation"'
Publikováno v:
Theoretical computer science, 655(B), 193-219. Elsevier
Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. As expected, the state space explosion threatens the analysability of these models. We therefore introduce confluence r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b386e425286dbe892c16dae878872101
https://doi.org/10.1016/j.tcs.2016.01.017
https://doi.org/10.1016/j.tcs.2016.01.017
Autor:
Timmer, Mark1 timmer@cs.utwente.nl, Katoen, Joost-Pieter1,2 katoen@cs.rwth-aachen.de, van de Pol, Jaco1 vdpol@cs.utwente.nl, Stoelinga, Mariëlle1 marielle@cs.utwente.nl
Publikováno v:
Theoretical Computer Science. Dec2016 Part B, Vol. 655, p193-219. 27p.
Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. Recently, the process algebra MAPA was introduced to efficiently model such systems. As always, the state space explosi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::7e5a539dd6e0c6b28f1b2eb2567ee7f3
https://research.utwente.nl/en/publications/confluence-reduction-for-markov-automata-extended-version(803bde29-22fc-4253-b121-c22a3fef4ebd).html
https://research.utwente.nl/en/publications/confluence-reduction-for-markov-automata-extended-version(803bde29-22fc-4253-b121-c22a3fef4ebd).html
Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. Recently, the process algebra MAPA was introduced to efficiently model such systems. As always, the state space explosi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___00893::180d0eac14a69176e1a3c76515cc125b
Autor:
Mateescu, Radu1 Radu.Mateescu@inria.fr, Wijs, Anton2 A.J.Wijs@tue.nl
Publikováno v:
Science of Computer Programming. Dec2014 Part 3, Vol. 96, p354-376. 23p.
Autor:
Timmer, Mark, van de Pol, Jan Cornelis, Stoelinga, Mariëlle Ida Antoinette, Braberman, Victor, Fribourg, Laurent
Publikováno v:
University of Twente Research Information (Pure Portal)
Lecture Notes in Computer Science ISBN: 9783642402289
FORMATS
Proceedings of the 11th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), 243-257
STARTPAGE=243;ENDPAGE=257;TITLE=Proceedings of the 11th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS)
Lecture Notes in Computer Science ISBN: 9783642402289
FORMATS
Proceedings of the 11th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), 243-257
STARTPAGE=243;ENDPAGE=257;TITLE=Proceedings of the 11th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS)
Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. Recently, the process algebra MAPA was introduced to efficiently model such systems. As always, the state space explosi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16f4411b84e9cfb93f53a7cb1de20373
https://research.utwente.nl/en/publications/fdcaa19a-65d8-4e39-820b-c3accb583035
https://research.utwente.nl/en/publications/fdcaa19a-65d8-4e39-820b-c3accb583035
Publikováno v:
Logical Methods in Computer Science, Volume 5, Issue 4 (December 22, 2009) lmcs:758
We study the equivalence relation on states of labelled transition systems of satisfying the same formulas in Computation Tree Logic without the next state modality (CTL-X). This relation is obtained by De Nicola & Vaandrager by translating labelled
Externí odkaz:
http://arxiv.org/abs/0912.2109
Publikováno v:
Computer Journal; Jan2014, Vol. 57 Issue 1, p73-92, 20p
The verification of linearizability -- a key correctness criterion for concurrent objects -- is based on trace refinement whose checking is PSPACE-complete. This paper suggests to use \emph{branching} bisimulation instead. Our approach is based on co
Externí odkaz:
http://arxiv.org/abs/1701.06104
Publikováno v:
Sofsem 2011: Theory & Practice of Computer Science; 2011, p494-505, 12p