Zobrazeno 1 - 10
of 71
pro vyhledávání: '"Benedikt Bollig"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 3 (2024)
We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality. As the satisfiability problem for this logic is undecidable in general, we i
Externí odkaz:
https://doaj.org/article/0ad2e84452094c26b1c2f4d03575c57d
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 2 (2024)
We propose a relaxation to the definition of well-structured transition systems (\WSTS) while retaining the decidability of boundedness and non-termination. In this class, the well-quasi-ordered (wqo) condition is relaxed such that it is applicable o
Externí odkaz:
https://doaj.org/article/c88d143b7d754abf986da596f14ee202
Autor:
Lina Ye, Igor Khmelnitsky, Serge Haddad, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 1 (2024)
Angluin's L$^*$ algorithm learns the minimal deterministic finite automaton (DFA) of a regular language using membership and equivalence queries. Its probabilistic approximatively correct (PAC) version substitutes an equivalence query by numerous ran
Externí odkaz:
https://doaj.org/article/8dd86d71259747fa8d865384a168fb80
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 1 (2022)
The undecidability of basic decision problems for general FIFO machines such as reachability and unboundedness is well-known. In this paper, we provide an underapproximation for the general model by considering only runs that are input-bounded (i.e.
Externí odkaz:
https://doaj.org/article/1bfc05fd87a94888b0c008e5ca7b3b44
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 3 (2019)
We consider the model-checking problem for freeze LTL on one-counter automata (OCA). Freeze LTL extends LTL with the freeze quantifier, which allows one to store different counter values of a run in registers so that they can be compared with one ano
Externí odkaz:
https://doaj.org/article/e35682648a1e41998bc70cdd1d91d4c9
Publikováno v:
Logical Methods in Computer Science, Vol Volume 10, Issue 4 (2014)
We introduce session automata, an automata model to process data words, i.e., words over an infinite alphabet. Session automata support the notion of fresh data values, which are well suited for modeling protocols in which sessions using fresh values
Externí odkaz:
https://doaj.org/article/58c4eb9291384b6980c571f65a7bc22e
Publikováno v:
Logical Methods in Computer Science, Vol Volume 6, Issue 3 (2010)
We examine a bidirectional propositional dynamic logic (PDL) for finite and infinite message sequence charts (MSCs) extending LTL and TLC-. By this kind of multi-modal logic we can express properties both in the entire future and in the past of an ev
Externí odkaz:
https://doaj.org/article/d3bc6eae47904d019d1f2ed2ff037659
Autor:
Benedikt Bollig
Publikováno v:
Logical Methods in Computer Science, Vol Volume 4, Issue 4 (2008)
Visibly pushdown automata are input-driven pushdown automata that recognize some non-regular context-free languages while preserving the nice closure and decidability properties of finite automata. Visibly pushdown automata with multiple stacks have
Externí odkaz:
https://doaj.org/article/0f3a1429a3de409d9daef5405c84cb90
Publikováno v:
42nd International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE 2022)
42nd International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE 2022), Jun 2022, Lucca, Italy. pp.50-66, ⟨10.1007/978-3-031-08679-3_4⟩
Formal Techniques for Distributed Objects, Components, and Systems ISBN: 9783031086786
42nd International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE 2022), Jun 2022, Lucca, Italy. pp.50-66, ⟨10.1007/978-3-031-08679-3_4⟩
Formal Techniques for Distributed Objects, Components, and Systems ISBN: 9783031086786
We propose a relaxation to the definition of a well-structured transition systems (WSTS) while retaining the decidability of boundedness and termination. In our class, we ease the well-quasi-ordered (wqo) condition to be applicable only between state
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f2fc69c0f25be8b2aed5df5e70b87e24
http://arxiv.org/abs/2211.15913
http://arxiv.org/abs/2211.15913
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031156281
A Journey from Process Algebra via Timed Automata to Model Learning
A Journey from Process Algebra via Timed Automata to Model Learning, 13560, Springer, pp.81-97, 2022, Lecture Notes in Computer Science, ⟨10.1007/978-3-031-15629-8_5⟩
A Journey from Process Algebra via Timed Automata to Model Learning
A Journey from Process Algebra via Timed Automata to Model Learning, 13560, Springer, pp.81-97, 2022, Lecture Notes in Computer Science, ⟨10.1007/978-3-031-15629-8_5⟩
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c0e80b1d0c39090a20bdb4af5d9a2b8f
https://doi.org/10.1007/978-3-031-15629-8_5
https://doi.org/10.1007/978-3-031-15629-8_5