Hierarchical concurrent finite state machines in Ptolemy

被引：20

作者：

Lee, B ^{[1
]}

Lee, EA ^{[1
]}

机构：

[1] Univ Calif Berkeley, Berkeley, CA 94720 USA

来源：

1998 INTERNATIONAL CONFERENCE ON APPLICATION OF CONCURRENCY TO SYSTEM DESIGN, PROCEEDINGS | 1998年

关键词：

D O I：

10.1109/CSD.1998.657537

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We implement a finite state machine (FSM) domain for specifying and simulating control functionality of a system within the Ptolemy software environment. The FSM domain is successfully integrated with synchronous dataflow (SDF) and discrete-event (DE) concurrency domains in Ptolemy. In this heterogeneous combination, the semantics of FSM, concurrency and hierarchy are naturally supported in a manner similar to hierarchical concurrent FSMs (HCFSMs). Unlike most formalisms that support HCFSMs, such as Statecharts and its variants, our scheme decouples the FSM from the concurrency models, enabling selection of the most appropriate concurrency model for the problem at hand.

引用

页码：34 / 40

页数：7