For the most recent entries see the Petri Nets Newsletter.

A Subset of Lotos with the Computational Power of Place/Transition-Nets.

Barbeau, M.; von Bochmann, G.

In: Ajmone Marsan, M.: Lecture Notes in Computer Science, Vol. 691; Application and Theory of Petri Nets 1993, Proceedings 14th International Conference, Chicago, Illinois, USA, pages 49-68. Springer-Verlag, 1993.

Abstract: In this paper, we define a subset of Lotos that can be modelled by finite Place/Transition-nets (P/T-nets). That means that specifications in that Lotos subset can be translated into finite P/T-nets and validated using P/T-net verification techniques. An important aspect of our work is that we show that conversely P/T-nets can be simulated in our Lotos subset. It means that the constraints we put on Lotos in order to obtain finite nets are minimally restrictive. We may also conclude that our Lotos subset and P/T-nets have equivalent computational power. To the best of our knowledge, no such bidirectional translation scheme has been published before.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography