Abstract
We show the integration of the three concepts of channel/agency-nets, functional programming and production rules into one uniform language for the executable specification of communicating production systems using a distributed version of the well known Towers of Hanoi problem as a sample application. The distributed active and passive components of a channel/agency-net are modelled based on a system view according to Backus' applicative state transition systems. For the description of complex state transitions the functional subsystem is extended by language features for specifying production rules. Having implemented a virtual machine we are able to run such specifications on a computer and observe the system's behaviour.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Backus, J.; Can Programming Be Liberated from the von Neumann Style ? Comm. ACM, Vol 21, 1978, 613–641
Brownston,L.,Farrell,R.,Kant,E,Martin,N.; Programming Expert Systems in OPS 5 — An Introduction to Rule-Based Programming? Addison Wesley, 1985
Cardelli, L.; Amber Lecture Notes in Comp. Science, Vol 242, 1986, 21–47
Cremers, A.B.; Hibbard, T.N.;Applicative State Transition Systems in LISP-like Notation Informatik Fachberichte, Vol 73, Springer Verlag 1983, 51–66
Cremers, A.B.; Hibbard, T.N.: A Programming Notation for Locally Synchronized Algorithms; in Bertolazzi, P.; Luccio, F. (ed.) VLSI-Algoritms and Architectures; North Holland 1985, 341–376
Cremers,A.B.; Igel,B.; Reichwein,G.; Distributed Rule-based AST-Systems IEEE Proc. Workshop on Future Trends of Distributed Computing Systems in the 90's, Hongkong 1988
Forgy, C.L.; RETE. A Fast Algorithm for the Many Pattern/ Many Object Pattern Match Problem; Artificial Intelligence, Vol.19, 1982, 17–37
Forgy, C.L.; The OPS83 Report Report CMU-CS-84-133, Carnegie-Mellon University, 1984
Harel, D.; Algorithmics — The Spirit of Computing Addison Wesley, 1987
Hoare, C.A.R.; Communicating Sequential Processes Comm. ACM, Vol 21, 1978, 666–677
Hoare, C.A.R.; An Overview of Some Formal Methods for Program Design IEEE Computer, Vol 9, 1987, 85–91
Igel,B.; Applicative Modelling of Embedded Systems in preparation
Igel, B.; Reichwein, G.; A Functional Subsystem for the Specification of Distributed Applicative State Transition Systems Report Dept. of Comp. Science VI, University of Dortmund, 1987
Milner,R.; A Proposal for Standard ML ACM Symp. on Lisp and Funct. Progr.,184–197, 1984
Nuutila, E.; Kuusela, J.; Tamminen, M.; Veilahti, J.; Arkko, J.; Bouteldja, N. XC — A Language for Embedded Rule Based Systems Sigplan Notices, Vol 22 #9, 1987, 23–32
Radensky, A.; Lazy Evaluation and Nondeterminism Make Backus' FP-Systems More Practical Sigplan Notices, Vol 22 #4, 1987, 33–40
Radig,B.,Krickhahn,R.; Die Wissensrepräsentationssprache OPS 5 — Sprachbeschreibung und Einführung in die regelorientierte Programmierung Vieweg, 1987
Reisig, W.; Petri Nets in Software Engineering Lecture Notes in Comp. Science, Vol 255, 1987, 63–96
Zave, P.; Exchange Functions: Interaction Primitives for Specifying Distributed Systems Techn. Report TM-82-11384-13, Bell Lab., 1982
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Igel, B., Reichwein, G. (1988). An example of communicating production systems. In: Vogt, F.H. (eds) CONCURRENCY 88. CONCURRENCY 1988. Lecture Notes in Computer Science, vol 335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50403-6_47
Download citation
DOI: https://doi.org/10.1007/3-540-50403-6_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50403-0
Online ISBN: 978-3-540-45999-6
eBook Packages: Springer Book Archive