Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Pierre Wolper"'
Publikováno v:
Formal Methods in System Design. 57:116-117
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4519d8971ece9f32d4eb017ed484867e
https://doi.org/10.1007/s10703-021-00375-3
https://doi.org/10.1007/s10703-021-00375-3
Publikováno v:
International Journal of Foundations of Computer Science. 20:647-667
This paper considers the problem of computing the real convex hull of a finite set of n-dimensional integer vectors. The starting point is a finite-automaton representation of the initial set of vectors. The proposed method consists in computing a se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bda16a80aac312c1269915f3cde2b72b
https://doi.org/10.1142/s0129054109006796
https://doi.org/10.1142/s0129054109006796
Autor:
Pierre Wolper, Axel Legay
Publikováno v:
Electronic Notes in Theoretical Computer Science. 150(1):3-8
Checking infinite-state systems is frequently done by encoding infinite sets of states as regular languages. Computing such a regular representation of, say, the reachable set of states of a system requires acceleration techniques that can finitely c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cab2dd3d0e08262332913163064ab2dd
Publikováno v:
Electronic Notes in Theoretical Computer Science. 138:101-115
Since the topic emerged several years ago, work on regular model checking has mostly been devoted to the verification of state reachability and safety properties. Though it was known that liveness properties could also be checked within this framewor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c9221251858a59161107b964981e6b47
https://doi.org/10.1016/j.entcs.2005.02.061
https://doi.org/10.1016/j.entcs.2005.02.061
Publikováno v:
ACM Transactions on Computational Logic. 6:614-633
This article considers finite-automata-based algorithms for handling linear arithmetic with both real and integer variables. Previous work has shown that this theory can be dealt with by using finite automata on infinite words, but this involves some
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c9773947c4aa7e96f2c9b723452e947
https://doi.org/10.1145/1071596.1071601
https://doi.org/10.1145/1071596.1071601
Publikováno v:
Information and Computation. 164(2):322-344
In computer system design, we distinguish between closed and open systems. A closed system is a system whose behavior is completely determined by the state of the system. An open system is a system that interacts with its environment and whose behavi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::622c3088139588a2083a891cdb3c9e1e
Autor:
Bernard Willems, Ahmed Bouajjani, Peter Rossmanith, Oded Maler, Alain Finkel, Javier Esparza, Pierre Wolper
Publikováno v:
Information Processing Letters. 74:221-227
Book and Otto (1993) solve a number of word problems for monadic string-rewriting systems using an elegant automata-based technique. In this note we observe that the technique is also very interesting from a pedagogical point of view, since it provid
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc56656ac33aadedf8ba9ffba475ee80
https://doi.org/10.1016/s0020-0190(00)00055-7
https://doi.org/10.1016/s0020-0190(00)00055-7
Publikováno v:
Journal of the ACM. 47:312-360
Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model-checking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branchin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c98e7df1e96d928dae269ad40c04788
https://doi.org/10.1145/333979.333987
https://doi.org/10.1145/333979.333987
Publikováno v:
Journal of Computer and System Sciences. 59:94-115
Traditionally, dependency theory has been developed for uninterpreted data. Specifically, the only assumption that is made about the data domains is that data values can be compared for equality. However, data is often interpreted and there can be ad
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ced78b7c8bf2e631642fa784318a19a
https://doi.org/10.1006/jcss.1999.1632
https://doi.org/10.1006/jcss.1999.1632
Publikováno v:
Theoretical Computer Science. 195:183-203
In concurrency theory, there are several examples where the interleaved model of concurrency can distinguish between execution sequences which are not significantly different. One such example is sequences that differ from each other by stuttering, i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f8848f921d1a9aaf2da1b47b84632470
https://doi.org/10.1016/s0304-3975(97)00219-3
https://doi.org/10.1016/s0304-3975(97)00219-3