The Timed Abstract State Machine (TASM) Toolset
Version 1.0.0.74 (aplha 1 - release 4)

Copyright (c) Massachusetts Institute of Technology

Released Wednesday, December 20th, 2006.

--------------------------------------------------------------------

New in this release:

-Completeness and Consistency can be verified for rules involving Integer variables

-The SAT problem used for completeness and consistency verification can be exported to the file system

-Communication channels in the style of CSP and CCS

-A new example, the production cell system (in the examples folder)


--------------------------------------------------------------------
LINUX VERSION COMING SOON
--------------------------------------------------------------------

Known Issues:

-Saving and Loading simulation does not save/load update set lists

-Exporting to XML does not save communication channels

-Compiler does not verify rule guard or rule effect for well-formedness

-Compiler feedback could be improved


--------------------------------------------------------------------
Please report issues, comments, feature requests, and feedback to:

tasm <at> mit <dot> edu

For more information and future releases, please visit:

http://esl.mit.edu/tasm


---------------------------------------------------------------------
To be removed from the TASM mailing list, please send an email to:

tasm <at> mit <dot> edu

with the subject "UNSUBSCRIBE" and an empty body


----------------------------------------------------------------------

Thank you for your interest in the TASM Toolset and Happy Holidays!

--The TASM Team