#### Filter Results:

- Full text PDF available (129)

#### Publication Year

1988

2018

- This year (12)
- Last 5 years (72)
- Last 10 years (137)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

Over the last few years there has been an increasing research eeort directed towards the automatic veriication of innnite state systems. For diierent classes of such systems (e.g., hybrid automata,… (More)

- Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, Yih-Kuen Tsay
- Inf. Comput.
- 2000

Interpretation. The above analysis algorithm can also be phrased in terms of abstract interpretation [CC77, JN94]. We intend to compute the fixpoint +X .I _ pre(X) for a set I S by iteration. Instead… (More)

Stateless model checking is a powerful technique for program verification, which however suffers from an exponential growth in the number of explored executions. A successful technique for reducing… (More)

- Parosh Aziz Abdulla, Aletta Nylén
- ICATPN
- 2001

We consider (unbounded) Timed Petri Nets (TPNs) where each token is equipped with a real-valued clock representing the “age” of the token. Each arc in the net is provided with a subinterval of the… (More)

- Parosh Aziz Abdulla, Bengt Jonsson
- LICS
- 1993

We consider the veriication of a particular class of innnite-state systems, namely systems consisting of nite-state processes that communicate via unbounded lossy FIFO channels. This class is able to… (More)

- Parosh Aziz Abdulla, Per Bjesse, Niklas Eén
- TACAS
- 2000

In this report we present an implementation of a symbolic reachability analyze r, FIXIT, based on SAT-methods. The problem of reachability is to determine for a given transition system, whether a set… (More)

- Parosh Aziz Abdulla, Aurore Collomb-Annichini, Ahmed Bouajjani, Bengt Jonsson
- Formal Methods in System Design
- 2004

We consider symbolic on-they veriication methods for systems of nite-state machines that communicate by exchanging messages via unbounded and lossy FIFO queues. We propose a novel representation… (More)

- Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman
- 2012 27th Annual IEEE Symposium on Logic in…
- 2012

We propose a model that captures the behavior of real-time recursive systems. To that end, we introduce dense-timed pushdown automata that extend the classical models of pushdown automata and timed… (More)

- Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Mayank Saksena
- CONCUR
- 2004

Regular model checking is being developed for algorithmic verification of several classes of infinite-state systems whose configurations can be modeled as words over a finite alphabet. Examples… (More)

- Parosh Aziz Abdulla
- Bulletin of Symbolic Logic
- 2010

In this paper, we give a step by step introduction to the theory of well quasi-ordered transition systems. The framework combines two concepts, namely (i) transition systems which are monotonic wrt.… (More)