?. ????????, ???????????? ????????: ?????????? ???????? ? ?? ???????????, ????????. ???????????: ?????, 1990.

?. ????????, ???????????? ??????????? ???????????? ????????, pp.28-48, 1993.

?. ???????, ??????? ?????????? ???????? ??? ?????? ???????????????? ???????????? ?????????????, ???????????? ??????????? ? ???????????, 2002.

?. ?. ???????, ?????????????? ?????????? ????????????? ???????????? ????????? ????????? ?? ?????? ???????????????? ????????????? ??????? ????????? ???????????? ??????????, ????????? ????????????? ??????? ??????????? ??????, ?????????? ? ????????????????? (?????????? ??????), pp.134-145, 2008.

?. ?. ????????, ?????????? ? ??????????? ???????????? ??????????? ?????????, ?????????? ?? ??????? ?????????? ??????? / ?. ?. ???????? // ????????? ?????-?????????????? ???????? ??? ?????????, ?????????? ? ??????? ??????, pp.20-20, 2003.

?. ?. ????????, ?????????? ????? ????? ??????????? ????????? ???????? ???????????? ????????, pp.128-140, 2007.

?. ?. ????????, ??????????? FOTL-??????? ????? ??????????? ????????? ???????? ? ????????, ????????? ??????????? ???????? ?????????? ? ????????????. ?????, pp.302-307, 2008.

?. ?. ????????, ?????? ???????????? ????????? ?????? ????????? ?????????? ????????? IEEE 1394 ?? ????? ??????????? ????? ???????? ? ????????, ????????? ????????????? ??????? ??????????? ??????, ?????????? ? ????????????????? (?????????? ??????). ?????, pp.32-43, 2008.

?. ?. ????????, ?????????? ???????????? ????? ??????????? ????? ???????? ? ???????? ??? ???????????? ????????? IEEE 1394 Root Contention, ????????? ??????????? ??????? ??????????? ??????????? ? ??????????? ? ??????? ??????????????. ??????, pp.15-21, 2008.

?. ?. ????????, ?????? ???????????? ????????? ?????? ???????? ?????????? ????????? IEEE 1394 ?? ????? ??????????? ????? ???????? ? ????????, pp.126-138, 2008.

?. ?. ????????, ?????????? ????????? ?????? ? ???????????? ??????????? ????????, pp.25-34, 2003.

?. ?. ????????, ?????????? ?????????????? ??????? ??????????? ?????? ? ?????????????? ??????? ?????????? ???????????? ?????????????? ??????, ????????? ???????????? ??????????? ? ??????? ??????????? ?????????? ???????????????? ???????? Microsoft. ?????-?????????: 2002. 2-4 ???????. ?. 23

?. ?. ???????, ??????? ???????? ? ????????-??????????????? ??????? ??????????? ?????????, ??? ???. ?. ??????. ???????????: ???????? ?????? ??????????? ??. ?.?. ??????, ??? ????????? ?????????, 1999.

?. ?. ????????, ?????????? ?????? ???????????? ????????, ??????: ???????????? ????? ?????????? ?????????????? ?????????? ? ??????????? ??? ??. ??????????, 1998.

?. ?. ??????????, ????? ???? BASIC-REAL ??? ???????????? ? ??????????? ??????? ?????????????? ??????, ??? ???. ?. ????????. ???????????: ???????? ?????? ??????????? ??. ?.?. ??????, ??? ????????? ?????????, 1999.

?. ?. ?????????, ?????????? ??????? ?????? ?????????? ?????? ? ??????? ????????????? ? ????????????? ??????? ??????????-?????????? ??????

?. ???????, ????? ??????????? ??????? ???????????? ????????? ????? ?????

?. ????????, ?????????? ???????????? ?????????????? ??????, ?????? ??????????? ????????? (?????? ????????) / ?. ?. ????????. ???????????? ?????, 1998.

V. N. Agafonov and /. V. Agafonov, From specification languages to specification knowledge bases: The PTO approach, Mathematical Foundations of Computer Science Lecture Notes in Computer Science. Porabka-Kozubnik, vol.379, pp.1-17, 1989.
DOI : 10.1007/3-540-51486-4_53

V. N. Agafonov, The knowledge based system supporting work with precise definitions: Tech. Rep, Agafonov: Faculty of Applied Mathematics and Computing Science, issue.5, 1995.

R. Alur, Model-Checking in Dense Real-Time, Information and Computation, vol.104, issue.1, pp.2-34, 1993.
DOI : 10.1006/inco.1993.1024

M. Anlauff, XASM- An Extensible, Component-Based Abstract State Machines Language, Abstract State Machines, Theory and Applications, International Workshop Proceedings, pp.69-90, 2000.
DOI : 10.1007/3-540-44518-8_6

C. C. Baier, J. Baier, and . Katoen, Principles of Model Checking

S. S. Baranov, V. Baranov, and . Kotlyarov, Automation of design and development of embedded software on the basis of a strictly defined software architecture, 25th Annual International Computer Software and Applications Conference. COMPSAC 2001, pp.329-331, 2001.
DOI : 10.1109/CMPSAC.2001.960635

M. Barnett, The ABCs of specification: AsmL, behavior, pp.517-526, 2001.

H. Baumeister, C. H. State-based-extensions-of, A. V. Baumeister, and . Zamulin, State-Based Extension of CASL, Second International Conference Proceedings, pp.3-24, 2000.
DOI : 10.1007/3-540-40911-4_2

D. D. Beauquier, T. Beauquier, E. Crolard, and . Prokofieva, Automatic verification of real time systems: A case study, Third Workshop on Automated Verification of Critical Systems (AVoCS'2003, pp.98-108, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00094624

D. D. Beauquier, T. Beauquier, E. Crolard, and . Prokofieva, Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference, TACAS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software Proceedings of Lecture Notes in Computer Science, pp.372-387, 2004.

D. Beauquier, A predicate logic framework for mechanical verification of realtime gurevich abstract state machines: A case study with pvs.: Tech. rep, 2000.

D. Beauquier, The railroad crossing problem: Towards semantics of timed algorithms and their model-checking in high-level languages / D. Beauquier, A. Slissenko // TAPSOFT'97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, pp.201-212, 1997.

D. Beauquier, D. Decidable, A. Beauquier, and . Slissenko, Decidable classes of the verification problem in a timed predicate logic, Fundamentals of Computation Theory, 12th International Symposium, FCT '99 Proceedings, pp.100-111, 1999.
DOI : 10.1007/3-540-48321-7_7

D. Beauquier, A. Beauquier, /. Slissenko, and . Theor, Decidable verification for reducible timed automata specified in a first order logic with time, Theoretical Computer Science, vol.275, issue.1-2, pp.347-388, 2002.
DOI : 10.1016/S0304-3975(01)00186-4

D. Beauquier, A. Beauquier, and . Slissenko, A first order logic for specification of timed algorithms: basic properties and a decidable class, Annals of Pure and Applied Logic, pp.1-3, 2002.
DOI : 10.1016/S0168-0072(01)00049-5

D. Beauquier, A. Beauquier, and . Slissenko, Periodicity based decidable classes in a first order timed logic, ANNALSPAL: Annals of Pure and Applied Logic, pp.43-73, 2006.
DOI : 10.1016/j.apal.2005.03.003
URL : https://hal.archives-ouvertes.fr/hal-00116950

E. Börger, A logical operational semantics of full prolog, Proceedings of the 15th International Symposium on Mathematical Foundations of Computer Science, MFCS'90, 1990.

E. Börger, Logic programming: The evolving algebra approach, Börger // IFIP 13th World Computer Congress, pp.391-395, 1994.

E. /. Börger, Y. Börger, D. Gurevich, and . Rosenzweig, The bakery algorithm: yet another specification and verification, pp.231-243, 1995.

E. Börger, P. Börger, J. Päppinghaus, and . Schmid, Abstract State Machines, Theory and Applications, Proceedings of Lecture Notes in Computer Science, pp.361-366, 1912.

E. E. Börger, E. Börger, J. Riccobene, /. J. Schmid, and . Ucs, Capturing requirements by abstract state machines: The light control case study, July, vol.6, issue.7, pp.597-620, 2000.

E. E. Börger, D. Börger, and . Rosenzweig, A mathematical definition of full Prolog, Science of Computer Programming, vol.24, issue.3, pp.249-286, 1995.
DOI : 10.1016/0167-6423(95)00006-E

E. Börger, /. E. Asms, J. Börger, and . Schmid, Composition and Submachine Concepts for Sequential ASMs, Proceedings, pp.41-60, 2000.
DOI : 10.1007/3-540-44622-2_3

E. /. Börger, R. Börger, and . Stärk, The Abstract State Machines Method for High-Level System Design and Analysis, 2003.
DOI : 10.1007/978-1-84882-736-3_3

G. D. Castillo and /. G. Castillo, Towards Comprehensive Tool Support for Abstract State Machines: The ASM Workbench Tool Environment and Architecture, P. Traverso, M. Ullmann. Lecture Notes in Computer Science, vol.1641, pp.311-325, 1998.
DOI : 10.1007/3-540-48257-1_21

A. Chaieb, Verifying Mixed Real-Integer Quantifier Elimination, Automated Reasoning, Third International Joint Conference Proceedings, pp.528-540, 2006.
DOI : 10.1007/11814771_43

J. Cohen, A. Cohen, . Slissenko, M. Switzerland, and . Verita, On Verification of Refinements of Timed Distributed Algorithms, Proc. of the Intern. Workshop on Abstract State Machines (ASM'2000), pp.34-49, 2000.
DOI : 10.1007/3-540-44518-8_4

H. Comon, Timed Automata and the Theory of Real Numbers, LNCS, vol.99, issue.1664, pp.242-257, 1999.
DOI : 10.1007/3-540-48320-9_18

J. J. Derrick, E. Derrick, and . Boiten, Refinement in Z and Object-Z: Foundations and Advanced Applications Formal Approaches to Computing and Information Technology, 2001.

E. W. Dijkstra, /. E. Multiprogramming-system, and . Dijkstra, The structure of the ???THE???-multiprogramming system, Communications of the ACM, vol.11, issue.5, pp.341-346, 1968.
DOI : 10.1145/363095.363143

E. W. Dijkstra and . Dijkstra, The discipline of programming, 1976.

A. A. Dolzmann, T. Dolzmann, V. Sturm, and . Weispfenning, Real Quantifier Elimination in Practice, Algorithmic Algebra and Number Theory, pp.221-247, 1998.
DOI : 10.1007/978-3-642-59932-3_11

E. A. Emerson, /. E. Temporal, and . Emerson, Handbook of Theoretical Computer Science B: Formal Models and Semantics, pp.996-1072, 1990.

E. A. Emerson and . Emerson, Automated temporal reasoning about reactive systems, Birtwistle. Lecture Notes in Computer Science, vol.1043, pp.41-101, 1995.
DOI : 10.1007/3-540-60915-6_3

R. R. Farahbod, V. Farahbod, U. Gervasi, and . Glässer, CoreASM: An extensible ASM execution engine, Abstract State Machines. 2005. Pp, pp.153-166

A. A. Gargantini, E. Gargantini, P. Riccobene, and . Scandurra, Exploiting the ASM method within the Model-Driven Engineering paradigm Rigorous Methods for Software Construction and Analysis, Dagstuhl Seminar Proceedings no. 06191. Internationales Begegnungs-und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, 2006.

S. J. Garland, . J. Lp-/-s, J. V. Garland, and . Guttag, LP: The larch prover, 9th International Conference on Automated Deduction Proceedings, pp.748-749, 1988.
DOI : 10.1007/BFb0012879

U. /. Glässer, R. Glässer, A. Gotzhein, and . Prinz, The formal semantics of SDL-2000: Status and perspectives, Computer Networks, vol.42, issue.3, pp.343-358, 1999.
DOI : 10.1016/S1389-1286(03)00247-0

U. Glässer, An abstract communication model: Tech. Rep. MSR-TR-2002-55, Gurevich, M. Veanes: Microsoft Research, 2002.

S. S. Graf, A. Graf, /. Prinz, and . Fundam, Time in state machines, Inform. Pp, vol.77, issue.12, pp.143-174, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00232812

Y. Gurevich, Evolving algebras: an attempt to discover semantics / Y. Gurevich // Current trends in theoretical computer science, pp.266-292, 1992.

Y. Gurevich, Evolving algebras 1993: Lipari Guide / Y. Gurevich // Specification and Validation Methods, pp.9-36, 1995.

Y. Gurevich, Sequential abstract-state machines capture sequential algorithms, ACM Transactions on Computational Logic, vol.1, issue.1, pp.77-111, 2000.
DOI : 10.1145/343369.343384

Y. Gurevich, The railroad crossing problem: An experiment with instantaneous actions and immediate reactions, Proceedings of CSL'95, pp.266-290, 1996.
DOI : 10.1007/3-540-61377-3_43

Y. Gurevich, J. K. Gurevich, and . Huggins, The semantics of the C programming language, Computer Science Logic, Proceedings, pp.274-308, 1992.
DOI : 10.1007/3-540-56992-8_17

Y. Gurevich, B. Gurevich, W. Rossman, and . Schulte, Semantic essence of AsmL, Theoretical Computer Science, vol.343, issue.3, 2004.
DOI : 10.1016/j.tcs.2005.06.017

J. V. Guttag, /. J. Guttag, E. Horowitz, D. R. Musser, and /. Cacm, Abstract data types and software validation, Communications of the ACM, vol.21, issue.12, pp.1048-1064, 1978.
DOI : 10.1145/359657.359666

C. E. Börger, N. G. Fruja, V. Gervasi, and R. F. Stärk, A high-level modular definition of the semantics of <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi mathvariant="normal">C</mml:mi><mml:mo>???</mml:mo></mml:math>, Theoretical Computer Science, vol.336, issue.2-3, pp.235-284, 2005.
DOI : 10.1016/j.tcs.2004.11.008

G. J. Holzmann, . J. /-g, and . Holzmann, The model checker SPIN, Special issue on Formal Methods in Software Practice, pp.279-295, 1997.
DOI : 10.1109/32.588521

A. M. Kappel, Executable specifications based on dynamic algebras, Logic Programming and Automated Reasoning,4th International Conference, LPAR'93, pp.229-240, 1993.
DOI : 10.1007/3-540-56944-8_56

L. Lamport, A new solution of Dijkstra's concurrent programming problem, Communications of the ACM, vol.17, issue.8, pp.453-455, 1974.
DOI : 10.1145/361082.361093

A. A. Letichevsky and . Letichevsky, Basic Protocols: Specification Language for Distributed Systems, Perspectives of Systems Informatics, 6th International Andrei Ershov Memorial Conference, PSI 2006, 2006.
DOI : 10.1007/978-3-540-70881-0_4

W. May, Specifying complex and structured systems with Evolving Algebras, 7th International Joint Conference CAAP/FASE Proceedings, pp.535-549, 1997.
DOI : 10.1007/BFb0030624

K. L. Mcmillan, Symbolic Model Checking, 1993.

R. Milner, . Communication, /. R. Concurrency, and . Milner, International Series in Computer Science, 1989.

M. J. Gordon and /. J. Gordon, HOL: A proof generating system for higher-order logic VLSI Specification, Verification and Synthesis, pp.73-128, 1988.

Y. Mokhtari, M. Mokhtari, S. Shirazipour, and . Tahar, A case study on model checking and refinement of abstract state machines, Proceedings of the Eigth International Conference on Computer Aided Systems Theory, pp.239-242, 2001.

D. Morgan, Numerical Methods: Real-time and Embedded Systems Programming / D. Morgan, p.496, 1992.

M. M. Oostdijk, H. Oostdijk, and . Geuvers, Proof by computation in the Coq system, Theoretical Computer Science, pp.293-314, 2002.
DOI : 10.1016/S0304-3975(00)00354-6

M. Ouimet, Timed abstract state machines: An executable specification language for reactive real-time systems: Tech, Lundqvist: Massachusetts Institute of Technology, 2006.

S. Owre, . S. Pvs, J. M. Owre, N. Rushby, and . Shankar, PVS: A prototype verification system, 11th International Conference on Automated Deduction, pp.748-752, 1992.
DOI : 10.1007/3-540-55602-8_217

C. Pahl, Towards an action refinement calculus for abstract state machines / C International Workshop on Abstract State Machines, Monte Verita, Switzerland, Local Proceedings, Pahl // Abstract State Machines ? ASM, pp.326-340, 2000.

A. Pnueli, The temporal logic of programs / A Pnueli, Proceedings of the 18th IEEE Symposium on the Foundations of Computer Science (FOCS- 77) / IEEE, pp.46-57, 1977.

J. Schmid, Introduction to asmgofer: Tech. rep, 2001.

A. A. Letichevsky, J. V. Kapitonova, and V. Kotlyarov, Semantics of Message Sequence Charts, Proceedings, pp.117-132, 2005.
DOI : 10.1007/11506843_8

I. Soloviev, The language of interpreter of distributed abstract state machines / I. Soloviev, A, Mathematical Modeling. Mathematical Research, vol.10, pp.161-170, 2003.

R. R. Stärk, J. Stärk, E. Schmid, and . Börger, Java and the Java Virtual Machine: Definition, Verification, 2001.
DOI : 10.1007/978-3-642-59495-3

N. Manna, A. Bjrner, and . Browne, Step: The stanford temporal prover: Tech. rep, 1994.

. Structured-specifications, . Interactive, K. W. With, G. Reif, K. Schellhorn et al., Automated Deduction: A Basis for Applications . Volume II, Systems and Implementation Techniques, 1998.

/. M. Barnett, E. Börger, and Y. Gurevich, Abstract State Machines, Theory and Applications, Using abstract state machines at microsoft: A case study Proceedings of Lecture Notes in Computer Science, pp.367-379, 1912.

A. Usov, Development of the Interpreter for Distributed ASMs / A Usov // Electronic Notes in Theoretical Computer Science, 2004.

T. T. Valkevych, A. Valkevych, and . Letichevsky, Simulating pccp program in the action language workbench, Workshop on Probabilistic Logic and Randomised Computation, held as part of the 10th European Summer School in Logic, Language and Information ESSLLI-98, 1998.

P. Vasilyev, Simulator for real-time abstract state machines Simulation, Verification and Validation of Enterprise Information Systems, Proceedings of the 4th International Workshop on Modelling, pp.202-205, 2006.

P. Vasilyev, Simulator for Real-Time Abstract State Machines, Proceedings of the 4th International Conference on Formal Modeling and Analysis of Timed Systems, pp.337-351, 2006.
DOI : 10.1007/11867340_24

P. Vasilyev, Simulator-model checker for reactive real-time abstract state machines / P, Proceedings of the ASM'07 the 14th International ASM Workshop

V. Weispfenning, Simulation and Optimization by Quantifier Elimination, Journal of Symbolic Computation, vol.24, issue.2, pp.189-208, 1997.
DOI : 10.1006/jsco.1997.0122

V. Weispfenning, Mixed real-integer linear quantifier elimination, Proc. of the 1999 Int. Symp. on Symbolic and Algebraic Computations (ISSAC'99, pp.129-136, 1999.

N. Wirth, Program development by stepwise refinement Communications of the Association of Computing Machinery, pp.221-227, 1971.

R. Yavorskiy, Translation of a fragment of asmL specification language to higher order logic, Yavorskiy: Microsoft Research, 2003.

A. Zamulin, Typed gurevich machines revisited / A, Joint NCC & IIS Bulletin Computer Science, issue.5, pp.1-26, 1997.

A. Zamulin, Specification of dynamic systems by typed gurevich machines / A, Proceedings of the 13th International Conference on System Science, pp.15-18, 1998.

A. Zamulin, Generic facilities in object International Workshop on Abstract State Machines, Monte Verita, Switzerland, Local Proceedings, Abstract State Machines ? ASM, pp.426-446, 2000.

A. V. Zamulin, Object-oriented abstract state machines / A. V, Proceedings of the 5th International Workshop on Abstract State Machines, pp.1-21, 1998.

C. ??????, ?????? ?????????????? ???????? ????? ??????? ?????. N odes = {0, 1}; ????????? ?????. ? ????? ????? ??????????? ?????? ??? ????. SignalT ype = N odes ? Signals; ?????? ??? ??? ??????? ??????? ? ?????? ????????. DelayT ype = N odes ? T ime; ??? ???????, ???????????? ????????? ???????? ??? ????

. ????????, ??? ???????? ????????? ????????????? ?????????? ???????: delay>0 ? ?t(0<f ast min ?f ast ? (t)?f ast max <slow min ?slow ? (t)?slow max )

P. ???????, Sent(0)=0 and Receive(0)=1 and CT >= Wait(0)) then [ Receive(1) := 2; Sent(0) := 2; Root(0) := true, ???? ?????? ? ??????? PN, ?? ????????? ???????? if (Sent(0)=1 and Receive(0)=1 and CT >= Wait(0)) then [ Receive

=. Ct and . Slow, Sent(1)=0 and Receive(1)=0 and CT >= Wait(1)) then [ Receive(0) := 1; Sent(1) := 1; ] if (Sent(1)=0 and Receive(1)=1 and CT >= Wait(1)) then [ Receive) := true, if (Sent(1)=1 and Receive(1)=1 and CT >= Wait(1)) then [ Receive) := CT + fast

. ??????????-????????????-????????-isroot, ????? ?????? ???????? ???? ? ????????????? CN ????????? ??????? ?? ????????, ?. ?. ????????????? ?????????? ??????? ?????? ?????????? ?????????? ????? ???????, ????? ???????????????? ????????: Saf ety : ¬(?t (Sent ? (t, 1) = Idle ? Receive ? (t, 1) = P N ? ?? > t, ) ? Sent ? (?, 1) = CN ? Sent ? (?, 2) = P N )) ? ?t (Sent ? (t, 2) = Idle ? Receive ? (t, 2) = P N ? ?? > t (Root ? (?, 2) ? Sent ? (?, 2) = CN ? Sent ? (?, 1) = P N ))), 2001.

. ?????-????-????????-????????-???????-????????????-main, ? ????? ?????? ????????? ?????????? ????????? ??????? ?????? ??? ?????????. ????? ???? ???? while