By Topic

Modeling the execution of LOTOS specifications by cooperating extended finite state machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Valenzano, A. ; Centro Elaborazione Numerale dei Segnali, Politecnico di Torino, Italy ; Sisto, R. ; Ciminiera, L.

The paper proposes an abstract execution model for LOTOS specifications, which is based on a number of cooperating extended finite state machines, applies to whatever LOTOS specification, with the only exclusion of those containing non well guarded recursion, and is suitable for a distributed implementation. Every machine represents a process, which does not necessarily correspond to one of the process definitions the specification is composed of. The machine instances (that is to say processes) can access variables, which correspond to LOTOS value identifiers, and can dynamically create new machine instances, thus enabling any infinite behaviour to be modeled. Synchronisation among the machines is achieved by a distributed algorithm which implements the multi-way rendezvous of LOTOS. The paper shows how the model is derived from LOTOS specifications and how it is executed

Published in:

Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on

Date of Conference:

9-13 Dec 1990