Sciweavers

44 search results - page 1 / 9
» Hierarchical Concurrent Finite State Machines in Ptolemy
Sort
View
ACSD
1998
IEEE
125views Hardware» more  ACSD 1998»
13 years 9 months ago
Hierarchical Concurrent Finite State Machines in Ptolemy
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 success...
Bilung Lee, Edward A. Lee
IFIPTCS
2000
13 years 8 months ago
Hierarchical State Machines
Hierarchical state machines are finite state machines whose states themselves can be other machines. In spite of their popularity in many modeling tools for software design, very l...
Mihalis Yannakakis
ICCS
2007
Springer
13 years 11 months ago
Composing Different Models of Computation in Kepler and Ptolemy II
A model of computation (MoC) is a formal abstraction of execution in a computer. There is a need for composing MoCs in e-science. Kepler, which is based on Ptolemy II, is a scienti...
Antoon Goderis, Christopher Brooks, Ilkay Altintas...
ITC
1999
IEEE
105views Hardware» more  ITC 1999»
13 years 9 months ago
Finite state machine synthesis with concurrent error detection
A new synthesis technique for designing finite state machines with on-line parity checking is presented. The output logic and the next-state logic of the finite state machines are...
Chaohuang Zeng, Nirmal R. Saxena, Edward J. McClus...