Аннотация

We develop constraint-based procedures to analyze safety, liveness and quantitative properties of certain models of distributed systems, especially Petri nets, population protocols and workflow nets. These procedures are incomplete in general, but have a lower complexity than the general problem and succeed on many practical instances or relevant subclasses of the model. We also show new complexity and decidability results for quantitative properties of workflow nets.

Линки и ресурсы

тэги

сообщество

  • @paves
  • @dblp
@paves- тэги данного пользователя выделены