Formal Treatment of Data Structures in Concurrency Models

The problem of real size system modelling with basic concurrency models like transition systems, Petri nets or process algebra is that there is no possibility to model easily the system data structures. Algebraic specification is a method well adapted to this last aspect and has been chosen to be mixed with the two major concurrency models which are process algebra and Petri nets. We present in this paper how the 'mixing' is done and what are the consequences concerning concurrency through the case of Lotos and Algebraic nets. Our approach is built on a simple case study which is given in several versions with both formalisms. The first one uses the basic models without algebraic specifications to highlight the data structures modelling problem. The second one is used to present how algebraic specifications are integrated in each concurrency model and the last one focuses on the concurrency aspects. Several propositions are then given in order to enhance the mixing of algebraic specifications and Petri nets or process algebra.<p> Keywords : Petri net, process algebra, data types, algebraic specification, algebraic net, Lotos.

fuer Informatik, Gesellschaft
Published in:
Colloquium FORMAL METHODS FOR CONCURRENCY, Muenchen, Germany, July 5 1996
Presented at:
Institut fuer Informatik, Ludwig-Maximilians-Universitaet

 Record created 2005-09-20, last modified 2018-11-14

guelfiFMFC_96 - Download fulltextPS
guelfiFMFC_96a - Download fulltextPS
Rate this document:

Rate this document:
(Not yet reviewed)