#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2005

2017

- This year (0)
- Last 5 years (3)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We give a simple and efficient method to prove safety properties for parameterized systems with linear topologies. A process in the system is a finite-state automaton, where the transitions areâ€¦ (More)

- Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr
- Logical Methods in Computer Science
- 2007

We consider qualitative and quantitative verification problems for infinitestate Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almost certainly eventuallyâ€¦ (More)

We consider verification of safety properties for parameterized systems with linear topologies. A process in the system is an extended automaton, where the transitions are guarded by both local andâ€¦ (More)

- Parosh Aziz Abdulla, Giorgio Delzanno, Noomene Ben Henda, Ahmed Rezine
- Int. J. Found. Comput. Sci.
- 2009

We introduce the simple and efficient method of monotonic abstraction to prove safety properties for parameterized systems with linear topologies. A process in the system is a finite-state automaton,â€¦ (More)

- Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr
- 20th Annual IEEE Symposium on Logic in Computerâ€¦
- 2005

We consider infinite Markov chains which either have a finite attractor or satisfy the global coarseness property. Markov chains derived from probabilistic lossy channel systems (PLCS) orâ€¦ (More)

Several recent works have considered parameterized verification, i.e. automatic verification of systems consisting of an arbitrary number of finite-state processes organized in a linear array. Theâ€¦ (More)

- Noomene Ben Henda, Karl Norrman
- RAID
- 2014

- Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, Sven Sandberg
- Third International Conference on theâ€¦
- 2006

We consider discrete infinite-state Markov chains which contain an eager finite attractor. A finite attractor is a finite subset of states that is eventually reached with probability 1 from everyâ€¦ (More)

- Parosh Aziz Abdulla, Noomene Ben Henda, Luca de Alfaro, Richard Mayr, Sven Sandberg
- FoSSaCS
- 2008

We consider turn-based stochastic games on infinite graphs induced by game probabilistic lossy channel systems (GPLCS), the game version of probabilistic lossy channel systems (PLCS). We study gamesâ€¦ (More)

- Noomene Ben Henda
- SPIN
- 2014

In telecommunication networks, it is common that security protocol procedures rely on context information and other parameters of the global system state. Current security ver- ification tools areâ€¦ (More)