# Analyzing Fair Parametric Extended Automata

@inproceedings{Bouajjani2001AnalyzingFP, title={Analyzing Fair Parametric Extended Automata}, author={Ahmed Bouajjani and Aurore Collomb-Annichini and Yassine Lakhnech and Mihaela Sighireanu}, booktitle={SAS}, year={2001} }

We address the problem of verifying safety and liveness properties for infinite-state systems, using symbolic reachability analysis. The models we consider are fair parametric extended automata, i.e., counter automata with parametric guards, supplied with fairness conditions on their transitions. In previous work, we shown that symbolic reachability analysis using acceleration techniques can be used to generate finite abstractions (symbolic graphs) of the original infinite-state model. In this…

## 12 Citations

### Preliminary Version Handling Liveness Properties in ( ω-) Regular Model Checking

- Computer Science
- 2004

This paper works out the exact constructions to be used in both cases, and solves the problem resulting from the fact that infinite computations of unbounded configurations might never contain the same configuration twice, thus making cycle detection problematic.

### Handling Liveness Properties in ( ω-) Regular Model Checking

- Computer Science
- 2004

This paper works out the exact constructions to be used in both cases, and solves the problem resulting from the fact that infinite computations of unbounded configurations might never contain the same configuration twice, thus making cycle detection problematic.

### Software model checking of liveness properties via transition invariants

- Computer Science
- 2003

The results are a characterization of the validity of a liveness property by the existence of transition invariant, and a method that uses transition predicate abstraction to compute transition invariants and thus prove liveness properties for infinite-state programs.

### Synthesis and Verification of Constraints in the PGM Protocol

- Computer ScienceFME
- 2003

This paper reports about modeling and constraint synthesis in the Pragmatic General Multicast (PGM) protocol, and proposes a methodology to deal with this problem using classical model-checking tools for timed and finite systems.

### Abstraction as the Key for Invariant Verification

- Computer ScienceVerification: Theory and Practice
- 2003

This work shows how to use the abstract system in a deductive proof even when the abstract model does not satisfy the specification and when it simulates the concrete system with respect to a weaker notion of simulation than Milner’s.

### A Checker for Modal Formulae for Processes with Data

- Mathematics, Computer ScienceFMCO
- 2003

A new technique for the automatic verification of first order modal μ-calculus formulae on infinite state, data-dependent processes is presented and reported on its functioning for the Bakery Protocol.

### Temporal Logic Analysis of Gene Networks Under Parameter Uncertainty

- Computer ScienceIEEE Transactions on Automatic Control
- 2008

This work proposes a method for the analysis of genetic regulatory networks under parameter uncertainty, which considers models based on piecewise-multiaffine differential equations, dynamical properties expressed in temporal logic, and intervals for the values of uncertain parameters.

### Abstract interpretation techniques for the verification of timed systems

- Philosophy
- 2005

En muchos sistemas, la correccion se puede decidir comparando las respuestas
a eventos del entorno con las descritas en la especificacion, En otros
dominios, la correccion no solo depende de que…

## References

SHOWING 1-10 OF 20 REFERENCES

### Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract)

- Computer Science, MathematicsICALP
- 1997

It is proved that CQDD's allow to compute the exact effect of the repeated execution of any fixed cycle in the transition graph of a system, and a generic reachability analysis semi-algorithm parametrized by a set of cycles Θ.

### Verifying Universal Properties of Parameterized Networks

- Computer ScienceFTRTFT
- 2000

Methods that allow to synthesize fairness conditions from the parameterized network and discuss under which conditions and how to lift fairness conditions of this network to fairness conditions on the abstract system are presented.

### Handling Global Conditions in Parameterized System Verification

- Computer ScienceCAV
- 1999

We consider symbolic verification for a class of parameterized systems, where a system consists of a linear array of processes, and where an action of a process may in general be guarded by both…

### On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels

- Computer Science, MathematicsCAV
- 1998

A novel representation formalism, called simple regular expressions (SREs), for representing sets of states of protocols with lossy FIFO channels is proposed, and it is shown that the class of languages representable by SREs is exactly theclass of downward closed languages that arise in the analysis of such protocols.

### Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems

- Computer ScienceCAV
- 2000

A semi-algorithmic approach based on using expressive symbolic representation structures called Parametric DBM’s, and accurate extrapolation techniques allowing to speed up the reachability analysis and help its termination is proposed.

### The Power of QDDs

- Computer Science
- 1997

This paper precisely characterizes when, and shows how, the operations required by a loop-first search can be applied to Q DDs, and addresses the problem of exploiting QDDs and loop- first searches to broaden the range of properties that can be checked from simple state reachability to temporal logic.

### Liveness and Acceleration in Parameterized Verification

- Computer ScienceCAV
- 2000

The paper considers the problem of uniform verification of parameterizedsystems by symbolic model checking, using formulas in fs1s (a syntactic variant of the 2nd order logic ws1s) for the symbolic…

### Timing Assumptions and Verification of Finite-State Concurrent Systems

- Computer Science, MathematicsAutomatic Verification Methods for Finite State Systems
- 1989

A scheme that allows timing assumptions to be incorporated into automatic proofs of arbitrary finite-state temporal properties is described, and it is conjecture that the method presented can be extended in this way.

### Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol

- Computer Science, MathematicsTACAS
- 1999

This work developed a tool prototype that provides an automatic verification of (the parameterized version of) the Bounded Retransmission Protocol and experiments the approach and shows how it can be effectively applied.