4 papers · 1 filter
Universal Safety for Timed Petri Nets is PSPACE-complete
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu +2
A timed network consists of an arbitrary number of initially identical 1-clock timed automata, interacting via hand-shake communication. In this setting there is no unique central…
Stateless Model Checking for POWER
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson +1
We present the first framework for efficient application of stateless model checking (SMC) to programs running under the relaxed memory model of POWER. The framework combines sever…
Proceedings 14th International Workshop on Verification of Infinite-State Systems
Mohamed Faouzi Atig, Ahmed Rezine
This volume contains the proceedings of Infinity'12, the 14th International Workshop on Verification of Infinite-State Systems, which was held in Paris, France on the 27th of Augus…
Adding Time to Pushdown Automata
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman
In this tutorial, we illustrate through examples how we can combine two classical models, namely those of pushdown automata (PDA) and timed automata, in order to obtain timed pushd…