Construction and SAT-Based Verification of Contextual Unfoldings

  • Stefan Schwoon
  • César Rodríguez
Conference paper

DOI: 10.1007/978-3-642-22600-7_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6808)
Cite this paper as:
Schwoon S., Rodríguez C. (2011) Construction and SAT-Based Verification of Contextual Unfoldings. In: Holzer M., Kutrib M., Pighizzini G. (eds) Descriptional Complexity of Formal Systems. DCFS 2011. Lecture Notes in Computer Science, vol 6808. Springer, Berlin, Heidelberg

Abstract

Unfoldings succinctly represent the set of reachable markings of a Petri net. Here, we shall consider the case of contextual nets, which extend Petri nets with read arcs, and which are more suitable to represent the case of concurrent read access. We discuss the problem of (efficiently) constructing unfoldings of such nets. On the basis of these unfoldings, various verification problems can be encoded as satisfiability problems in propositional logic.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Stefan Schwoon
    • 1
  • César Rodríguez
    • 1
  1. 1.LSV, ENS de Cachan & CNRS, INRIACachanFrance

Personalised recommendations