Combining programs and state machines

State machines consume and process actions complementary to programs issuing actions. State machines maintain a state and reply with a boolean response to each action in their interface. As state machines offer a service to programs, their interface is also called a service interface. State machines can be combined with several natural operators, thus giving rise to a state machine calculus. State machines are used for abstract data type modeling. © 2002 Published by Elsevier Science Inc.

[1]  Kees Middelburg,et al.  Notations for Software Design , 1994, Formal Approaches to Computing and Information Technology (FACIT).

[2]  Jan A. Bergstra What is an Abstract Datatype? , 1978, Inf. Process. Lett..

[3]  J. C. vanVliet Colloquium capita datastructuren , 1978 .

[4]  C. A. R. Hoare,et al.  Laws of programming , 1987, CACM.

[5]  Jan A. Bergstra,et al.  Process algebra and conditional composition , 2001, Inf. Process. Lett..

[6]  Jan A. Bergstra,et al.  Kleene's Three-Valued Logic and Process Algebra , 1998, Inf. Process. Lett..

[7]  Jan A. Bergstra,et al.  Program Algebra for Component Code , 2000, Formal Aspects of Computing.

[8]  Jan A. Bergstra,et al.  Program algebra for sequential code , 2002, J. Log. Algebraic Methods Program..

[9]  Jan A. Bergstra Datatypen bezien vanuit de recursietheorie , 1978 .

[10]  Jan A. Bergstra,et al.  Equational specifications of finite minimal unoids, using unary hidden functions only , 1982 .