Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Sutre, Grégoire"'
We revisit finite-state communicating systems with round-based communication under mailbox semantics. Mailboxes correspond to one FIFO buffer per process (instead of one buffer per pair of processes in peer-to-peer systems). Round-based communication
Externí odkaz:
http://arxiv.org/abs/2407.06968
Autor:
Leroux, Jérôme, Sutre, Grégoire
Vector addition system with states is an ubiquitous model of computation with extensive applications in computer science. The reachability problem for vector addition systems is central since many other problems reduce to that question. The problem i
Externí odkaz:
http://arxiv.org/abs/2007.09096
The verification of safety properties for concurrent systems often reduces to the coverability problem for Petri nets. This problem was shown to be ExpSpace-complete forty years ago. Driven by the concurrency revolution, it has regained a lot of inte
Externí odkaz:
http://arxiv.org/abs/1607.05956
We study pushdown vector addition systems, which are synchronized products of pushdown automata with vector addition systems. The question of the boundedness of the reachability set for this model can be refined into two decision problems that ask if
Externí odkaz:
http://arxiv.org/abs/1507.07362
Does the trace language of a given vector addition system (VAS) intersect with a given context-free language? This question lies at the heart of several verification questions involving recursive programs with integer parameters. In particular, it is
Externí odkaz:
http://arxiv.org/abs/1503.04018
We study the reachability problem for communicating timed processes, both in discrete and dense time. Our model comprises automata with local timing constraints communicating over unbounded FIFO channels. Each automaton can only access its set of loc
Externí odkaz:
http://arxiv.org/abs/1209.0571
Publikováno v:
Logical Methods in Computer Science, Volume 8, Issue 3 (September 27, 2012) lmcs:921
The reachability analysis of recursive programs that communicate asynchronously over reliable FIFO channels calls for restrictions to ensure decidability. Our first result characterizes communication topologies with a decidable reachability problem r
Externí odkaz:
http://arxiv.org/abs/1209.0359
Autor:
Leroux, Jérôme, Sutre, Gregoire
Publikováno v:
Static Analysis, Kongens Lyngby : Danemark (2007)
Acceleration in symbolic verification consists in computing the exact effect of some control-flow loops in order to speed up the iterative fix-point computation of reachable states. Even if no termination guarantee is provided in theory, successful r
Externí odkaz:
http://arxiv.org/abs/0812.2011
Publikováno v:
Logical Methods in Computer Science
Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2019
Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2019, 15 (4), ⟨10.23638/LMCS-15(4:15)2019⟩
Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2019
Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2019, 15 (4), ⟨10.23638/LMCS-15(4:15)2019⟩
We consider numerical functions weakly computable by grammar-controlled vector addition systems (GVASes, a variant of pushdown Petri nets). GVASes can weakly compute all fast growing functions $F_\alpha$ for $\alpha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7317f094aee4056a364db9cc8e063229
Publikováno v:
FSTTCS 2018-38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
FSTTCS 2018-38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2018, Ahmedabad, India. pp.31:1-31:14, ⟨10.4230/LIPIcs.FSTTCS.2018.31⟩
FSTTCS 2018-38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2018, Ahmedabad, India. pp.31:1-31:14, ⟨10.4230/LIPIcs.FSTTCS.2018.31⟩
International audience; We prove that the reachability relation of two-counter machines with one zero-test and one reset is Presburger-definable and effectively computable. Our proof is based on the introduction of two classes of Presburger-definable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::55d8935032fb82dc036dcda1f7268cbc
https://hal.archives-ouvertes.fr/hal-01848554
https://hal.archives-ouvertes.fr/hal-01848554