A subset of Lotos with the computational power of Place/Transition-nets

  • Michel Barbeau
  • Gregor v. Bochmann
Full Papers

DOI: 10.1007/3-540-56863-8_40

Part of the Lecture Notes in Computer Science book series (LNCS, volume 691)
Cite this paper as:
Barbeau M., v. Bochmann G. (1993) A subset of Lotos with the computational power of Place/Transition-nets. In: Ajmone Marsan M. (eds) Application and Theory of Petri Nets 1993. ICATPN 1993. Lecture Notes in Computer Science, vol 691. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Michel Barbeau
    • 1
  • Gregor v. Bochmann
    • 2
  1. 1.Département de mathématiques et d'informatiqueUniversité de SherbrookeSherbrookeCanada
  2. 2.Département d'IROUniversité de MontréalMontréalCanada

Personalised recommendations