Ordered Counter-Abstraction - Refinable Subword Relations for Parameterized Verification

Abstract

We present an original refinable subword based symbolic representation for the verification of linearly ordered parameterized systems. Such a system consists of arbitrary many finite processes placed in an array. Processes communicate using global transitions constrained by their relative positions (i.e., priorities). The model can include binary… (More)
DOI: 10.1007/978-3-319-04921-2_32

2 Figures and Tables

Topics

  • Presentations referencing similar topics