Zobrazeno 1 - 10
of 34
pro vyhledávání: '"EC Grant Agreement nr.: FP7/214755"'
Autor:
Sijtema, M., Salaün, G., Schätz, B., Belinfante, Axel, Stoelinga, Mariëlle Ida Antoinette, Marinelli, L.
Publikováno v:
Science of computer programming, 80(Part A), 188-209. Elsevier
16th International Workshop on Formal Methods for Industrial Critical Systems, FMICS 2011, 117-133
STARTPAGE=117;ENDPAGE=133;TITLE=16th International Workshop on Formal Methods for Industrial Critical Systems, FMICS 2011
Formal Methods for Industrial Critical Systems ISBN: 9783642244308
FMICS
16th International Workshop on Formal Methods for Industrial Critical Systems, FMICS 2011, 117-133
STARTPAGE=117;ENDPAGE=133;TITLE=16th International Workshop on Formal Methods for Industrial Critical Systems, FMICS 2011
Formal Methods for Industrial Critical Systems ISBN: 9783642244308
FMICS
We report on the actual industrial use of formal methods during the development of a software bus. During an internship at Neopost Inc., of 14 weeks, we developed the server component of a software bus, called the XBus, using formal methods during th
Publikováno v:
IEEE transactions on dependable and secure computing, 7(2), 128-143. IEEE
Fault trees (FT) are among the most prominent formalisms for reliability analysis of technical systems. Dynamic FTs extend FTs with support for expressing dynamic dependencies among components. The standard analysis vehicle for DFTs is state-based, a
Autor:
J., Hilston, de Alfaro, Luca, Faella, Marco, M.Z., Kwiatkowska, Telek, M., Stoelinga, Mariëlle Ida Antoinette
Publikováno v:
IEEE transactions on software engineering, 35(2):10.1109/TSE.2008.106, 258-273. IEEE
We extend the classical system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted not as boolean values, but as elements of arbitrary metric spaces. Trace incl
Publikováno v:
Theoretical computer science, 538, 103-123. Elsevier
Confluence reduction and partial order reduction by means of ample sets are two different techniques for state space reduction in both traditional and probabilistic model checking. This paper provides an extensive comparison between these two methods
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a44415ad5a7a10c1b35086611372201d
https://research.utwente.nl/en/publications/62dece1f-ee0b-425f-b71c-7be840697612
https://research.utwente.nl/en/publications/62dece1f-ee0b-425f-b71c-7be840697612
Publikováno v:
CHI
CHI 2014: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, 1459-1466
STARTPAGE=1459;ENDPAGE=1466;TITLE=CHI 2014
CHI 2014: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, 1459-1466
STARTPAGE=1459;ENDPAGE=1466;TITLE=CHI 2014
Gestures are important non-verbal signals in human communication. Research with virtual agents and robots has started to add to the scientific knowledge about gestures but many questions with respect to the use of gestures in human-computer interacti
Autor:
Mark Timmer
Quantitative model checking is concerned with the verification of both quantitative and qualitative properties over models incorporating quantitative information. Increases in expressivity of the models involved allow more types of systems to be anal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d668731f60b716f03539402dffb8ebf0
https://research.utwente.nl/en/publications/efficient-modelling-generation-and-analysis-of-markov-automata(226df5a7-82e6-488b-8516-3af16f103ed6).html
https://research.utwente.nl/en/publications/efficient-modelling-generation-and-analysis-of-markov-automata(226df5a7-82e6-488b-8516-3af16f103ed6).html
Autor:
Di Pierro, A., Katoen, Joost P., van de Pol, Jan Cornelis, Norman, G., Stoelinga, Mariëlle Ida Antoinette, Timmer, Mark
Publikováno v:
Theoretical computer science, 413(1), 36-57. Elsevier
Theoretical Computer Science
Theoretical Computer Science
This paper presents a novel linear process-algebraic format for probabilistic automata. The key ingredient is a symbolic transformation of probabilistic process algebra terms that incorporate data into this linear format while preserving strong proba
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3d75c6869e3fa7909ff2dc40747d5684
https://research.utwente.nl/en/publications/a07d79e6-a04c-42ee-af82-93ab26c4e826
https://research.utwente.nl/en/publications/a07d79e6-a04c-42ee-af82-93ab26c4e826
Publikováno v:
QEST
Proceedings of the 8th International Conference on Quantitative Evaluation of SysTems, QEST 2011, 149-150
STARTPAGE=149;ENDPAGE=150;TITLE=Proceedings of the 8th International Conference on Quantitative Evaluation of SysTems, QEST 2011
Proceedings of the 8th International Conference on Quantitative Evaluation of SysTems, QEST 2011, 149-150
STARTPAGE=149;ENDPAGE=150;TITLE=Proceedings of the 8th International Conference on Quantitative Evaluation of SysTems, QEST 2011
This paper presents SCOOP: a tool that symbolically optimises process-algebraic specifications of probabilistic processes. It takes specifications in the prCRL language (combining data and probabilities), which are linearised first to an intermediate
Publikováno v:
Proceedings of the 3rd Young Researchers Workshop on Concurrency Theory
To improve the efficiency of model checking in general, and probabilistic model checking in particular, several reduction techniques have been introduced. Two of these, confluence reduction and partial-order reduction by means of ample sets, are base
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::0db67b3802b29a4d2406f6a29742c6b6
https://research.utwente.nl/en/publications/confluence-versus-ample-sets-in-probabilistic-branching-time(cd660215-3031-4c33-b59a-be0b0fc304d1).html
https://research.utwente.nl/en/publications/confluence-versus-ample-sets-in-probabilistic-branching-time(cd660215-3031-4c33-b59a-be0b0fc304d1).html
To improve the efficiency of model checking in general, and probabilistic model checking in particular, several reduction techniques have been introduced. Two of these, confluence reduction and partial-order reduction by means of ample sets, are base
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___00893::8a67e3f2a17b1a805668feb9baaa837d