Abstract
Basic ideas and constructs of the Model-100 language designed for describing behavior of interacting processes are discussed. Process interaction rules are specified by clauses of the form “if … then …” (Horn clauses). Structure of the interactions is presented by a graph described by a rational term. Execution of one step of the program reduces to simultaneous application of all rules to all nodes to which the rule can be applied (i.e., to all rational subterms with which the Horn clause can be unified).
Similar content being viewed by others
References
Elmqvist, H., Mattsson, S.E., and Otter, M., Modelica—an International Effort to Design an Object-oriented Modeling Language, Proc. of Summer Computer Simulation Conference-98, Reno, USA, 1998, pp. 19–22.
Knuth, D.E., On Translation of Languages from Left to Right, in Programming Languages, Genuys, F., Ed., London: Macdonald, 1968. Translated under the title Yazyki i avtomaty, Moscow: Mir, 1972, pp. 9–42.
Courcelle, B., Fundamentals Properties of Infinite Trees, Theor. Comput. Sci., 1983, vol. 25, no. 2, pp. 95–169.
Babichev, A.V., Weak Second-Order Monadic Theories as a Basis for Creation of Data Specification Languages, Avtom. Telemekh., 1997, no. 2, pp. 194–208.
Logical Programming, Moscow: Mir, 1988.
Holzner, S., Inside XSLT, New Readers, 2001.
Author information
Authors and Affiliations
Additional information
Original Russian Text © A.V. Babichev, V.G. Lebedev, 2007, published in Programmirovanie, 2007, Vol. 33, No. 1.
Rights and permissions
About this article
Cite this article
Babichev, A.V., Lebedev, V.G. Model-100: Specification language for interacting processes. Program Comput Soft 33, 2–13 (2007). https://doi.org/10.1134/S0361768807010021
Received:
Issue Date:
DOI: https://doi.org/10.1134/S0361768807010021