Hierarchical Concurrent Finite State Machines in Ptolemy

Authors:
Bilung Lee;Edward A. Lee
Affiliations:
-;-
Venue:
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
Year:
1998

Citing 0
Cited 5

Multilanguage design of heterogeneous systems

CODES '99 Proceedings of the seventh international workshop on Hardware/software codesign
Automata for Context-Dependent Connectors

COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Modeling software requirement with timing diagram and Simulink Stateflow

Information and Software Technology
A model of context-dependent component connectors

Science of Computer Programming
A specification language for reo connectors

FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.