Verification of parametric concurrent systems with prioritised FIFO resource management

  • Authors:

  • Ahmed Bouajjani;Peter Habermehl;Tomáš Vojnar

  • Affiliations:

  • LIAFA, University Paris 7--Denis Diderot/CNRS, Paris Cedex 05, France 75251;LIAFA, University Paris 7--Denis Diderot/CNRS, Paris Cedex 05, France 75251;FIT, Brno University of Technology, Brno, Czech Republic 61266

  • Venue:
  • Formal Methods in System Design
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the problem of parametric verification over a class of systems of processes competing for access to shared resources. We suppose the access to the resources to be controlled according to a FIFO-based policy with a possibility of distinguishing low-priority and high-priority resource requests. We propose a model of the concerned systems based on extended automata with queues. Over this model, we address verification of properties expressed in LTL驴X enriched with global process quantification and interpreted on finite as well as fair behaviours of the given systems. In addition, we examine parametric verification of process deadlockability too. By reducing the parametric verification problems to finite-state model checking, we establish several decidability results for different classes of the considered properties and systems (including the special case of systems with the pure FIFO resource management). Furthermore, we show that parametric verification against formulae with local process quantification is undecidable in the given context.