Bisimilarity and behaviour-preserving reconfigurations of open Petri nets

  • Authors:
  • Paolo Baldan;Andrea Corradini;Hartmut Ehrig;Reiko Heckel;Barbara König

  • Affiliations:
  • Dipartimento di Matematica Pura e Applicata, Università di Padova, Italy;Dipartimento di Informatica, Università di Pisa, Italy;Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin, Germany;Department of Computer Science, University of Leicester, UK;Abteilung für Informatik und Angewandte Kognitionswissenschaft, Universität Duisburg-Essen, Germany

  • Venue:
  • CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a framework for the specification of behaviourpreserving reconfigurations of systems modelled as Petri nets. The framework is based on open nets, a mild generalisation of ordinary Place/ Transition nets suited to model open systems which might interact with the surrounding environment and endowed with a colimit-based composition operation. We show that natural notions of (strong and weak) bisimilarity over open nets are congruences with respect to the composition operation. We also provide an up-to technique for facilitating bisimilarity proofs. The theory is used to identify suitable classes of reconfiguration rules (in the double-pushout approach to rewriting) whose application preserves the observational semantics of the net.