Skip to main content
Article thumbnail
Location of Repository

Forcing Monotonicity in Parameterized Verification: From Multisets to Words

By Parosh Aziz Abdulla

Abstract

Abstract. We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes; the aim is to prove correctness of the system regardless of the number of processes inside the system. First, we consider a class of parameterized systems whose behaviours can be captured exactly as Petri nets using counter abstraction. This allows analysis using the framework of monotonic transition systems introduced in [1]. Then, we consider parameterized systems for which there is no natural ordering which allows monotonicity. We describe the method of monotonic abstraction which provides an over-approximation of the transition system. We consider both systems where the over-approximation gives rise to reset Petri nets, and systems where the abstract transition relation is a set of rewriting rules on words over a finite alphabet.

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.186.7520
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://user.it.uu.se/%7Eparosh... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.