Zobrazeno 1 - 10
of 130
pro vyhledávání: '"Alain FInkel"'
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:
Alain Finkel, Etienne Lozes
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023)
A system of communicating finite state machines is synchronizable if its send trace semantics, i.e.the set of sequences of sendings it can perform, is the same when its communications are FIFO asynchronous and when they are just rendez-vous synchroni
Externí odkaz:
https://doaj.org/article/376cf254b0e84f2f864024ad5e6a3a58
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
Autor:
Alain Finkel, M. Praveen
Publikováno v:
Logical Methods in Computer Science, Vol Volume 16, Issue 4 (2020)
The decidability and complexity of reachability problems and model-checking for flat counter machines have been explored in detail. However, only few results are known for flat (lossy) FIFO machines, only in some particular cases (a single loop or a
Externí odkaz:
https://doaj.org/article/2f04ec861fbf489a9fa1d88014193e29
Autor:
Thomas Rabeyron, Alain Finkel
Publikováno v:
Frontiers in Psychology, Vol 11 (2020)
Externí odkaz:
https://doaj.org/article/7171417314e9423f93174af834f6cbe3
Publikováno v:
Logical Methods in Computer Science, Vol Volume 16, Issue 2 (2020)
This paper is a sequel of "Forward Analysis for WSTS, Part I: Completions" [STACS 2009, LZI Intl. Proc. in Informatics 3, 433-444] and "Forward Analysis for WSTS, Part II: Complete WSTS" [Logical Methods in Computer Science 8(3), 2012]. In these two
Externí odkaz:
https://doaj.org/article/9a5bc483a33c4578b5c713176ba4de35
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 3 (2017)
The well-quasi-ordering (i.e., a well-founded quasi-ordering such that all antichains are finite) that defines well-structured transition systems (WSTS) is shown not to be the weakest hypothesis that implies decidability of the coverability problem.
Externí odkaz:
https://doaj.org/article/af221c46e67e4a83a2a206aeed0bb4e0
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 63, Iss Proc. WORDS 2011, Pp 93-102 (2011)
The Parikh finite word automaton model (PA) was introduced and studied by Klaedtke and Ruess in 2003. Here, by means of related models, it is shown that the bounded languages recognized by PA are the same as those recognized by deterministic PA. More
Externí odkaz:
https://doaj.org/article/2a6f4072a7db4951a5a52ef9f77cf330
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 10, Iss Proc. INFINITY 2009, Pp 3-22 (2009)
This paper clarifies the picture about Dense-choice Counter Machines, which have been less studied than (discrete) Counter Machines. We revisit the definition of "Dense Counter Machines" so that it now extends (discrete) Counter Machines, and we prov
Externí odkaz:
https://doaj.org/article/194a98cac8c0479cbf1d8d31ca38e9ec
Autor:
Alain Finkel, Jean Goubault-Larrecq
Publikováno v:
Logical Methods in Computer Science, Vol Volume 8, Issue 3 (2012)
We describe a simple, conceptual forward analysis procedure for infinity-complete WSTS S. This computes the so-called clover of a state. When S is the completion of a WSTS X, the clover in S is a finite description of the downward closure of the reac
Externí odkaz:
https://doaj.org/article/636041d00663441c936055fdaa508653