Verification of parametric concurrent systems with prioritised FIFO resource management

We consider the problem of parametric verification over a class ofsystems of processes competing for access to sharedresources. We suppose the access to the resources to be controlledaccording to a FIFO-based policy with a possibility of distinguishinglow-priority and high-priority resource requests. We propose a model ofthe concerned systems based on extended automata with queues. Over thismodel, we address verification of properties expressed in LTL\Xenriched with global process quantification and interpreted on finiteas well as fair behaviours of the given systems. In addition, weexamine parametric verification of process deadlockability too. Byreducing the parametric verification problems to finite-state modelchecking, we establish several decidability results for differentclasses of the considered properties and systems (including the specialcase of systems with the pure FIFO resource management). Moreover, weshow that parametric verification against formulae with local processquantification is undecidable in the given context.