Deriving Concurrent Synchronous EFSMs from Protocol Specifications in LOTOS (Special Section on Selected Papers from the 11th Workshop on Circuits and Systems in Karuizawa)
暂无分享,去创建一个
In this paper , we proposeanalgorithmto convert a given structuredLOTOS specificationinto anequivalent flattenedmodelcalled synchronous EFSMs. The synchronousEFSMs model is an execution model for communication protocols anddistributedsystemswhereeach systemconsistsof concurrentEFSMsanda finite setof multi-rendezvous indicationsamongtheir subsets.TheEFSMscanbederivedfrom a specificationin a sub-classof LOTOSandits implementationbecomessimpler thanthestraightforwardimplementationof theoriginal LOTOSspecification becausethe synchronizationamongthe processe s in themodeldoes not have anychild-parent relationships, which canmakethesynchronization mechanism muchmorecomplex. Someexperimental resultsarereportedto show theadvantageof synchronousEFSMs in termsof execution efficiency. key words: LOTOS, synchronous EFSMs, transformation, multirendezvous,implementation
[1] Toru Hasegawa,et al. A LOTOS compiler and process synchronization manager , 1990, PSTV.
[2] Eric Dubuis,et al. An Algorithm for Translating LOTOS Behavior Expressions into Automata and Ports , 1989, FORTE.