4 Hits in 2.4 sec

How to Compose Presburger-Accelerations: Applications to Broadcast Protocols [chapter]

Alain Finkel, Jérôme Leroux
2002 Lecture Notes in Computer Science  
doi:10.1007/3-540-36206-1_14 fatcat:haglqhwx65bnhnlxir7wkgtxbu

Page 9203 of Mathematical Reviews Vol. , Issue 2004k [page]

2004 Mathematical Reviews  
Anna Labella (Rome) 2004k:68109 68Q60 Finkel, Alain (F-ENSET-SV; Cachan) ; Leroux, Jéréme (F-ENSET-SV; Cachan) How to compose Presburger-accelerations: applications to broadcast protocols.  ...  FAST computes in a few seconds the minimal deterministic finite automata that represent the reachability sets of 8 well-known broadcast protocols.”  ... 

The Well Structured Problem for Presburger Counter Machines [article]

Alain Finkel, Ekanshdeep Gupta
2019 arXiv   pre-print
While Affine VASS of dimension one are not, in general, well structured, we give an algorithm that computes the set of predecessors of a configuration; as a consequence this allows to decide the well structured  ...  How to compose presburger-accelerations: Applications to broadcast protocols.  ...  By P ost c i (n) we denote i successive applications of a cycle to n. To show that P re c * (φ q ) is effectively computable, we will look at multiple cases: Case 1: s < ∞.  ... 
arXiv:1910.02736v1 fatcat:y2yt7nrjevd6bhmk5rhnl7ge5e

Page 725 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
: applica- tions to broadcast protocols.  ...  Res. 37 (2003), no. 4, 235-247 (2004). 90B18 (05C70, 90C35) — see also Workshop: Scheduling in Computer and Manufacturing Systems Finkel, Alain (with Leroux, Jér6me) How to compose Presburger-accelerations  ...