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 propose an algorithm to convert a given structured LOTOS specification into an equivalent flattened model called synchronous EFSMs. The synchronous EFSMs model is an execution model for communication protocols and distributed systems where each system consists of concurrent EFSMs and a finite set of multi-rendezvous indications among their subsets. The EFSMs can be derived from a specification in a sub-class of LOTOS and its implementation becomes simpler than the straightforward implementation of the original LOTOS specification because the synchronization among the processes in the model does not have any child-parent relationships, which can make the synchronization mechanism much more complex. Some experimental results are reported to show the advantage of synchronous EFSMs in terms of execution efficiency.
- 社団法人電子情報通信学会の論文
- 1999-03-25
著者
-
Yasumoto Keiichi
Faculty Of Economics Shiga University
-
Higashino Teruo
Department Of Informatics And Mathematical Science Osaka University
-
Higashino Teruo
The Department Of Informatics And Mathematical Science Graduate School Of Engineering Science Osaka
-
Kitajima Akira
Department Of Informatics And Mathematical Science Graduate School Of Engineering Science Osaka Univ
-
TANIGUCHI Kenichi
Department of Information and Computer Sciences, Faculty of Engineering Science, Osaka University
-
Taniguchi Kenichi
Department Of Informatics And Mathematical Science Osaka University
-
Taniguchi Kenichi
Department of Hydrocarbon Chemistry, Kyoto University
関連論文
- A WDS Clustering Algorithm for Wireless Mesh Networks
- An Optical-Drop Wavelength Assignment Algorithm for Efficient Wavelength Reuse under Heterogeneous Traffic in WDM Ring Networks(Discrete Mathematics and Its Applications)
- A Minimum Dead Space Algorithm for Generalized Isochronous Channel Reuse Problems in DQDB Networks(Network)
- P2PMM_router : A Two-Stage Heuristic Algorithm to Peer-to-Peer Multicast Routing Problems in Multihome Networks(Discrete Mathematics and Its Applications)
- A Quasi-Solution State Evolution Algorithm for Channel Assignment Problems in Cellular Networks(Special Section on Discrete Mathematics and Its Applications)
- Proposal of a Multi-Threaded Processor Architecture for Embedded Systems and Its Evaluation(Special Section of Selected Papers from the 13th Workshop on Circuits and Systems in Karuizawa)
- Time-Action Alternating Model for Timed Processes and Its Symbolic Verification of Bisimulation
- Synthesis of Protocol Specifications from Service Specifications of Distributed Systems in a Marked Graph Model (Special Section on Net Theory and Its Applications)
- A Proposal of Optimal Path Selection Algorithm for Static and Mobile Multicast Routing Problems
- Deriving Concurrent Synchronous EFSMs from Protocol Specifications in LOTOS (Special Section on Selected Papers from the 11th Workshop on Circuits and Systems in Karuizawa)
- A Method to Convert Concurrent EFSMs with Multi-Rendezvous into Synchronous Sequential Circuit(Special Section on Concurrent Systems Technology)
- Execution Time Analysis for Binary Code Executed on a Pipelined Processor Using Parametric Model Checking
- Relaxation of Coefficient Sensitiveness to Performance for Neural Networks Using Neuron Filter through Total Coloring Problems
- A Proposal of Neuron Filter: A Constraint Resolution Scheme of Neural Networks for Combinatorial Optimization Problems
- A Minimal-State Processing Search Algorithm for Graph Coloring Problems
- The carbonylation of .ALPHA.-haloacetophenones and benzyl halides by disodium tetracarbonylferrate.