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.
This work was performed within a research project on object-oriented specifications funded by Bell-Northern Research (BNR) and the Computer Research Institute of Montréal (CRIM). Funding from the Natural Sciences and Engineering Research Council of Canada is also acknowledged.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
P. Azema, G. Juanole, E. Sanchis, M. Montbernard, Specification and Verification of Distributed Systems Using Prolog Interpreted Petri Nets, 7th International Conference on Software Engineering, 1984.
M. Barbeau, G. v. Bochmann, Extension of the Karp and Miller Procedure to Lotos Specifications, Computer Aided Verification'90, ACM/AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 3, 1991, pp. 103–119; and Springer-Verlag, LNCS 531, pp. 333–342.
M. Barbeau, G. v. Bochmann, The Lotos Model of a Fault Protected System and its Verification Using a Petri Net Based Approach, Workshop on Computer-aided verification, Aalborg, Danemark, 1991; and Springer-Verlag, LNCS 575.
T. Bolognesi, E. Brinksma, Introduction to the ISO Specification Language Lotos, Computer Networks and ISDN Systems, Vol. 14, No. 1, 1987, pp. 25–59.
T. Bolognesi, A Graphical Composition Theorem for Networks of Lotos Processes, Proceedings of Distributed Computing Systems, Paris, May–June 1990, pp. 88–95.
G. Boudol, G. Roucairol, R. de Simone, Petri Nets and Algebraic Calculi of Processes, Advances in Petri Nets, 1985, pp. 41–58.
G. W. Brams, Réseaux de Petri: Théorie et Pratique — T.1. Théorie et analyse, Masson, Paris, 1983.
F. de Cindio, G. de Michelis, L. Pomello, C. Simone, Milner's Communicating Systems and Petri Nets, in: A. Pagnoni, G. Rozenberg (Eds.), Application and Theory of Petri Nets, Springer-Verlag, IFB 66, 1983, pp. 40–59.
P. Degano, R. de Nicola, U. Montanari, A Distributed Operational Semantics for CCS Based on Condition/Event Systems, Acta Informatica, Vol. 26, 1988, pp. 59–91.
H. Garavel, E. Najm, Tilt: From Lotos to Labelled Transition Systems, in: P. H. J. van Eijk, C. A. Vissers, M. Diaz (Eds.), The Formal Description Technique Lotos, North-Holland, 1989, pp. 327–336.
H. Garavel, J. Sifakis, Compilation and Verification of Lotos Specifications, PSTV X, Ottawa, 1990, pp. 359–376.
R. J. van Glabbeek, F. W. Vaandrager, Petri Net Models for Algebraic Theories of Concurrency, Proceedings of PARLE, Vol. II, LNCS 259, Springer-Verlag, 1987.
U. Goltz, A. Mycroft, On the Relationship of CCS and Petri Nets, in: J. Paredaens (Ed.), Proceedings of ICALP 84, LNCS 172, Springer-Verlag, 1984, pp. 196–208.
U. Goltz, W. Reisig, CSP-Programs as Nets with Individual Tokens, in: G. Rozenberg (Ed.), Advances in Petri Nets 1984, LNCS 188, Springer-Verlag, 1985, pp. 169–196.
U. Goltz, On Representing CCS Programs by Finite Petri Nets, in: M. Chytil et al. (Eds.), Mathematical Foundations of Computer Science 1988, LNCS 324, Springer-Verlag, 1988, pp. 339–350.
R. Gotzhein, Specifying Abstract Data Types with Lotos, Proc. of PSTV VI, Montréal, 1986.
ISO, Lotos — A Formal Description Technique Based on the Temporal Ordering of Observational Behavior, IS 8807, E. Brinksma (Ed.), 1988.
T. Kasai, R. E. Miller, Homomorphisms Between Models of Parallel Computation, J.C.S.S., Vol. 25, 1982, pp. 285–331.
S. Marchena, G. Leon, Transformation from Lotos Specs to Galileo Nets, in: K. J. Turner (Ed.), Formal Description Techniques, North-Holland, 1989.
M. Nielsen, CCS and its Relationship to Net Theory, in: W. Brauer, Advances in Petri Nets 1986, Part II, LNCS 255, Springer-Verlag, 1986.
E.-R. Olderog, Nets, Terms and Formulas: Three Views of Concurrent Processes and their Relationships, Cambridge Tracts in Theoretical Computer Science 23, Cambridge University Press, 1991.
D. M. R. Park, Concurrency and Automata on Infinite Sequences, Proceedings of 5th GI Conf. on Theoretical Computer Science, LNCS 104, Springer-Verlag, 1981, pp. 167–183.
J. L. Peterson, Petri Net Theory and the Modelling of Systems, Prentice Hall, 1981.
W. Reisig, Partial Order Semantics Versus Interleaving Semantics for CSP-like Languages and Its Impact on Fairness, in: G. Goos, J. Hartmanis, 11th Colloquium on Automata, Languages and Programming, LNCS 172, Springer-Verlag, 1984, pp. 403–413.
D. Taubner, Finite Representation of CCS and TCSP Programs by Automata and Petri Nets, LNCS 369, Springer-Verlag, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/3-540-56863-8_40
Download citation
DOI: https://doi.org/10.1007/3-540-56863-8_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56863-6
Online ISBN: 978-3-540-47759-4
eBook Packages: Springer Book Archive