4 citations · 5 across the 3 of their papers we have counts for
3 papers
Reachability for dynamic parametric processes
Anca Muscholl, Helmut Seidl, Igor Walukiewicz
In a dynamic parametric process every subprocess may spawn arbitrarily many, identical child processes, that may communicate either over global variables, or over local variables t…
On parametrized verification of asynchronous, shared-memory pushdown systems
Marie Fortin, Anca Muscholl, Igor Walukiewicz
We consider the model of parametrized asynchronous shared-memory pushdown systems, as introduced in [Hague'11]. In a series of recent papers it has been shown that reachability in…
Fast detection of cycles in timed automata
Aakash Deshpande, Frédéric Herbreteau, B. Srivathsan +2
We propose a new efficient algorithm for detecting if a cycle in a timed automaton can be iterated infinitely often. Existing methods for this problem have a complexity which is ex…