English

Homogeneous Equations of Algebraic Petri Nets

Logic in Computer Science 2016-06-23 v3

Abstract

Algebraic Petri nets are a formalism for modeling distributed systems and algorithms, describing control and data flow by combining Petri nets and algebraic specification. One way to specify correctness of an algebraic Petri net model NN is to specify a linear equation EE over the places of NN based on term substitution, and coefficients from an abelian group GG. Then, EE is valid in NN iff EE is valid in each reachable marking of NN . Due to the expressive power of Algebraic Petri nets, validity is generally undecidable. Stable linear equations form a class of linear equations for which validity is decidable. Place invariants yield a well-understood but incomplete characterization of all stable linear equations. In this paper, we provide a complete characterization of stability for the subclass of homogeneous linear equations, by restricting ourselves to the interpretation of terms over the Herbrand structure without considering further equality axioms. Based thereon, we show that stability is decidable for homogeneous linear equations if GG is a cyclic group.

Keywords

Cite

@article{arxiv.1606.05490,
  title  = {Homogeneous Equations of Algebraic Petri Nets},
  author = {Marvin Triebel and Jan Sürmeli},
  journal= {arXiv preprint arXiv:1606.05490},
  year   = {2016}
}

Comments

Preprint of Paper accepted for CONCUR 2016 including full proofs