Forward Analysis for WSTS, Part II: Complete WSTS

  • Alain Finkel
  • Jean Goubault-Larrecq
Conference paper

DOI: 10.1007/978-3-642-02930-1_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5556)
Cite this paper as:
Finkel A., Goubault-Larrecq J. (2009) Forward Analysis for WSTS, Part II: Complete WSTS. In: Albers S., Marchetti-Spaccamela A., Matias Y., Nikoletseas S., Thomas W. (eds) Automata, Languages and Programming. ICALP 2009. Lecture Notes in Computer Science, vol 5556. Springer, Berlin, Heidelberg

Abstract

We describe a simple, conceptual forward analysis procedure for ∞-complete WSTS \(\mathfrak S\). This computes the clover of a state s0, i.e., a finite description of the closure of the cover of s0. When \(\mathfrak S\) is the completion of a WSTS \(\mathfrak X\), the clover in \(\mathfrak S\) is a finite description of the cover in \(\mathfrak X\). We show that this applies exactly when \(\mathfrak X\) is an ω2-WSTS, a new robust class of WSTS. We show that our procedure terminates in more cases than the generalized Karp-Miller procedure on extensions of Petri nets. We characterize the WSTS where our procedure terminates as those that are clover-flattable. Finally, we apply this to well-structured counter systems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Alain Finkel
    • 1
  • Jean Goubault-Larrecq
    • 1
    • 2
  1. 1.LSV, ENS Cachan, CNRSFrance
  2. 2.INRIA SaclayFrance

Personalised recommendations