![](bg4.png)
5 Conclusion
In this paper several new important features concerning the semantics of the ASM based
language were described. These features will help us to build and verify specifications
of real-time systems via a customizable simulation of the models. The most impor-
tant parameters of simulation can be configured, i.e. external functions, time delays
for language operations and constructs, non-determinism resolving. The whole project
is aimed at development of a simulator for the described version of ASM language
extension where the results of the current work are used. At the moment a simulator
prototype is ready, which implements most of the specified features: lexical and syn-
tactical analysis, building a parse tree containing full information, loading definitions
of external functions from a file, loading the simulation parameters, simulation of most
constructs and operations of Timed ASML, output the results of simulation.
References
1. Gurevich, Y.: Evolving algebras 1993: Lipari Guide. In Egon, B., ed.: Specification and
Validation Methods. Oxford University Press (1995) 9–36
2. Beauquier, D., Slissenko, A.: A first order logic for specification of timed algorithms: Basic
properties and a decidable class. Annals of Pure and Applied Logic 113 (2002) 13–52
3. Beauquier, D., Slissenko, A.: Periodicity based decidable classes in a first order timed logic.
(Annals of Pure and Applied Logic) 38 pages. To appear.
4. Gurevich, Y.: Sequential abstract-state machines capture sequential algorithms. ACM Trans-
actions on Computational Logic 1 (2000) 77–111
5. Huggins, J.: (University of Michigan, ASM homepage) http://www.eecs.umich.edu/gasm/.
6. B
¨
orger, E. St
¨
ark, R.: Abstract State Machines: A Method for High-Level System Design and
Analysis. (2003)
7. Foundations of Software Engineering — Microsoft Research, Microsoft Corporation: AsmL:
The Abstract State Machine Language. (2002) http://research.microsoft.com/fse/asml/.
8. Soloviev, I. Usov, A.: The language of interpreter of distributed abstract state machines.
Tools for Mathematical Modeling. Mathematical Research. 10 (2003) 161–170
9. B
¨
orger, E. Gurevich, Y., Rosenzweig, D.: The bakery algorithm: yet another specification
and verification. In B
¨
orger, E., ed.: Specification and Validation Methods. Oxford University
Press (1995) 231–243
10. Cohen, J., Slissenko, A.: On verification of refinements of timed distributed algorithms. In
Gurevich, Y., Kutter, P., Odersky, M., Thiele, L., eds.: Proc. of the Intern. Workshop on Ab-
stract State Machines (ASM’2000), March 20–24, 2000, Switzerland, Monte Verita, Ticino.
Lect. Notes in Comput. Sci., vol. 1912, Springer-Verlag (2000) 34–49
11. Lamport, L.: A new solution of Dijkstra’s concurrent programming problem. In: Communi-
cations of ACM, 17(8). (1974) 453–455
205