See the demo ptolemy/domains/fsm/demo/ABP/ABP.xml, which implements an alternating bit protocol using state machines with no refinements.
The expression language supports strings...
Edward
At 12:22 PM 5/4/2005 +0800, Neil E. Turner wrote:
This doesn't seem to have gone thru before...
----- Original Message ----- From: "Neil E. Turner" <[EMAIL PROTECTED]> To: <ptolemy-hackers@eecs.berkeley.edu> Sent: Tuesday, May 03, 2005 3:54 PM Subject: constructing simple state machines, no refinements
Hi,
I want to construct a simple state machine that needs no refinements. It just needs to respond to an input from a set of valid inputs and then (upon state transitions) produce an optional output. (For those familiar, this would be a basic EECS20 state machine.)
I want to test my algorithm for processing and validating a specifically formatted, ASCII response that is coming in over a microcontroller's UART channel.
Specific questions: 1. How can I produce outputs from the transition expressions and feed them to the output port? 2. How can I use/access the inputs coming in to my modal model actor within the transition expression?
I guess a 3rd, less important, question would be is there a way to express strings in ASCII within Ptolemy II?
Thanks, Neil
---------------------------------------------------------------------------- Posted to the ptolemy-hackers mailing list. Please send administrative mail for this list to: [EMAIL PROTECTED]
------------
Edward A. Lee
Professor, Chair of the EE Division, Associate Chair of EECS
231 Cory Hall, UC Berkeley, Berkeley, CA 94720
phone: 510-642-0253 or 510-642-0455, fax: 510-642-2845
[EMAIL PROTECTED], http://ptolemy.eecs.berkeley.edu/~eal
---------------------------------------------------------------------------- Posted to the ptolemy-hackers mailing list. Please send administrative mail for this list to: [EMAIL PROTECTED]
