In: Abstract State Machines (ASM 2003) -- Advances in Theory and Practice, Proceedings of the 10th International Workshop, Taormina, Italy, March 3-7, 2003, pages 1-421pp. Volume 2589 of Lecture Notes in Computer Science / E. Börger, A. Gargantini, E. Riccobene (Eds.) --- Springer Verlag, March 2003.
Abstract: A rich variety of system models for sequential, deterministic systems has been suggested during recent decades, including automata, process algebras, many versions of Petri Nets, and models to describe the semantics of Programming languages. All models for sequential, deterministic systems assume a set S of states, or configurations, and a next state function y: S -> S.