Causal Semantics of Algebraic Petri Nets distinguishing Concurrency and Synchronicity

  • Authors:

  • Gabriel Juhá/s;Robert Lorenz;Sebastian Mauser

  • Affiliations:

  • Faculty of Electrical Engineering and Information Technology, Slovak University of Technology Bratislava, Slovakia. gabriel.juhas@stuba.sk;Department of Applied Computer Science, Catholic University of Eichstä/tt-Ingolstadt, Germany. robert.lorenz@ku-eichstaett.de/ sebastian.mauser@ku-eichstaett.de;(Correspd.) Department of Applied Computer Science, Catholic University of Eichstä/tt-Ingolstadt, Germany. robert.lorenz@ku-eichstaett.de/ sebastian.mauser@ku-eichstaett.de

  • Venue:
  • Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we show how to obtain causal semantics distinguishing "earlier than" and "not later than" causality between events from algebraic semantics of Petri nets. Janicki and Koutny introduced so called stratified order structures (so-structures) to describe such causal semantics. To obtain algebraic semantics, we redefine our own algebraic approach generating rewrite terms via partial operations of synchronous composition, concurrent composition and sequential composition. These terms are used to produce so-structures which define causal behavior consistent with the (operational) step semantics. For concrete Petri net classes with causal semantics derived from processes minimal so-structures obtained from rewrite terms coincide with minimal so-structures given by processes. This is demonstrated for elementary nets with inhibitor arcs.