Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Vincent Bloemen"'
Publikováno v:
IEEE transactions on visualization and computer graphics, 26(1):8805450, 1054-1063. IEEE
IEEE Transactions on Visualization and Computer Graphics, 26(1):8805450, 1054-1063. IEEE Computer Society
IEEE Transactions on visualization and computer graphics, 26(1), 1054-1063. IEEE Computer Society
IEEE Transactions on Visualization and Computer Graphics, 26(1):8805450, 1054-1063. IEEE Computer Society
IEEE Transactions on visualization and computer graphics, 26(1), 1054-1063. IEEE Computer Society
While analyzing multiple data sequences, the following questions typically arise: how does a single sequence change over time, how do multiple sequences compare within a period, and how does such comparison change over time. This paper presents a vis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b56fcef0c5d5e624a8ea74c0163cf97
https://doi.org/10.1109/tvcg.2019.2934289
https://doi.org/10.1109/tvcg.2019.2934289
Autor:
Boudewijn F. van Dongen, Jaco van de Pol, Wil M. P. van der Aalst, Vincent Bloemen, Sebastiaan J. van Zelst
Publikováno v:
Information Systems, 103:101456. Elsevier
Information systems, 103:101456. Elsevier
Bloemen, V, Zelst, S V, Aalst, W V D, Dongen, B V & Pol, J V D 2022, ' Aligning observed and modelled behaviour by maximizing synchronous moves and using milestones ', Information Systems, vol. 103, 101456 . https://doi.org/10.1016/j.is.2019.101456
Information systems, 103:101456. Elsevier
Bloemen, V, Zelst, S V, Aalst, W V D, Dongen, B V & Pol, J V D 2022, ' Aligning observed and modelled behaviour by maximizing synchronous moves and using milestones ', Information Systems, vol. 103, 101456 . https://doi.org/10.1016/j.is.2019.101456
Given a process model and an event log, conformance checking aims to relate the two together, e.g. to detect discrepancies between them. For the synchronous product net of the process and a log trace, we can assign different costs to a synchronous mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::702048db92acb88b0da73dfad459583d
https://doi.org/10.1016/j.is.2019.101456
https://doi.org/10.1016/j.is.2019.101456
Publikováno v:
International journal on software tools for technology transfer, 21(3), 307-324. Springer
Bloemen, V, Duret-Lutz, A & van de Pol, J 2019, ' Model checking with generalized Rabin and Fin-less automata ', International Journal on Software Tools for Technology Transfer, vol. 21, no. 3, pp. 307-324 . https://doi.org/10.1007/s10009-019-00508-4
Bloemen, V, Duret-Lutz, A & van de Pol, J 2019, ' Model checking with generalized Rabin and Fin-less automata ', International Journal on Software Tools for Technology Transfer, vol. 21, no. 3, pp. 307-324 . https://doi.org/10.1007/s10009-019-00508-4
In the automata theoretic approach to explicit state LTL model checking, the synchronized product of the model and an automaton that represents the negated formula is checked for emptiness. In practice, a (transition-based generalized) Büchi automat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f55a578bc9c2c73e7ff8498494fca72
https://research.utwente.nl/en/publications/46605527-3ca7-493f-b50d-5fa90da73429
https://research.utwente.nl/en/publications/46605527-3ca7-493f-b50d-5fa90da73429
Publikováno v:
ACSD
2018 18th International Conference on Application of Concurrency to System Design: Proceedings, 50-59
STARTPAGE=50;ENDPAGE=59;TITLE=2018 18th International Conference on Application of Concurrency to System Design
2018 18th International Conference on Application of Concurrency to System Design: Proceedings, 50-59
STARTPAGE=50;ENDPAGE=59;TITLE=2018 18th International Conference on Application of Concurrency to System Design
Conformance checking is a branch of process mining that aims to assess to what degree a given set of log traces and a corresponding reference model conform to each other. The state-of-the-art approach in conformance checking is based on the concept o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9ba812d0a2c49700739898416dad63b5
https://doi.org/10.1109/acsd.2018.00008
https://doi.org/10.1109/acsd.2018.00008
Publikováno v:
SPIN
SPIN 2017: Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, 50-59
STARTPAGE=50;ENDPAGE=59;TITLE=SPIN 2017
SPIN 2017: Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, 50-59
STARTPAGE=50;ENDPAGE=59;TITLE=SPIN 2017
In the automata theoretic approach to explicit state LTL model checking, the synchronized product of the model and an automaton that represents the negated formula is checked for emptiness. In practice, a (transition-based generalized) Buchi automato
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b7cacfb3c498ad4afb46d05464de3f1
https://doi.org/10.1145/3092282.3092288
https://doi.org/10.1145/3092282.3092288
Publikováno v:
International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-based Methods in Programming Environments (CICLOPS)
International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-based Methods in Programming Environments (CICLOPS), 2014, Vienne, Austria
International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-based Methods in Programming Environments (CICLOPS), 2014, Vienne, Austria
International audience; This paper describes three significant extensions for the Finite Domain solver of GNU Prolog. First, the solver now supports negative integers. Second, the solver detects and prevents integer overflows from occurring. Third, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ebbcae869b3934edd3c3567cbcf93088
https://hal.archives-ouvertes.fr/hal-01220207
https://hal.archives-ouvertes.fr/hal-01220207