Verification: Theory and Practice

  • Sankaranarayanan S
  • Sipma H
  • Manna Z
N/ACitations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

Petri nets have been widely used to model and analyze con- current systems. Their wide-spread use in this domain is, on one hand, facilitated by their simplicity and expressiveness. On the other hand, the analysis of Petri nets for questions like reachability, boundedness and deadlock freedom can be surprisingly hard. In this paper, we model Petri nets as transition systems.We exploit the special structure in these transition systems to provide an exact and closed-form characterization of all its inductive linear invariants.We then exploit this characterization to provide an invariant generation technique that we demonstrate to be efficient and powerful in practice. We compare our work with those in the literature and discuss extensions.

Cite

CITATION STYLE

APA

Sankaranarayanan, S., Sipma, H., & Manna, Z. (2003). Verification: Theory and Practice. Lecture Notes in Computer Science, 2772, 682–701. Retrieved from http://link.springer.com/10.1007/b12001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free