Asynchronous Circuits, Communicating Processes, and Muller Automaton

• Autorzy: Rędziejowski R.R.
• Języki publikacji: EN

Abstrakty

EN

A finite-state model of communicating processes is presented alongside with the Muller-Bartky model of asynchronous circuits. The purpose of such presentation is to expose a close similarity of these models, at a level of abstraction much lower than the Muller automaton.

Słowa kluczowe

EN

asynchronous circuitis; communicating sequential processes; Muller-Bartky model

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2004
• Tom: Vol. 61, nr 1
• Strony: 47--59
• Opis fizyczny: Bibliogr. 9 poz., tab., wykr.

Twórcy

autor

Rędziejowski R.R.

• Ceremonimästarvägen 10, S-18140 Lidingö, Sweden,

Bibliografia

• [1] Dijkstra, E. W.: Cooperating Sequential Processes, Technical Report EWD123, Technological University. Eindhoven. 1965.
• [2] Dijkstra, E. W.: Cooperating sequential processes, in: Programming Languages (F. Genuys, Ed.), Academic Press, New York, 1968, 43-112.
• [3] Farwer, B.: ω-Automata, in: Automata. Logics, and Infinite Games (E. Gradel, W. Thomas, T. Wilke, Eds.), number 2500 in Lecture Notes in Computer Science, Springer, 2002. 3-21.
• [4] Gilbert, P., Chandler. W. J.: Interference between communicating parallel processes. Communications of the ACM. 15, 1972,427-437.
• [5] Mulier, D. E.: Infinite sequences and finite machines. Switching Circuit Theory and Logical Design: Proc. 4th Ann. Symp., IEEE, New York. 1963. 3-16.
• [6] Mulier, D. E., Bartky, W. S.: A theory of asynchronous circuits, Proc. Int. Symp. on the Theory of Switching, Part I, Harvard University Press, 1959, 204-243.
• [7] Perrin, D., Pin, J.-E.: Infinite Words. Automata. Semigroups, Logic and Games, Number 141 in Pure and Applied Mathematics, Elsevier. 2004.
• [8] Redziejowski. R. R.: The theory of general events and its application to parallel programming. Technical Report TP 18.220, IBM Nordic Laboratory. Lidingo, 1972.
• [9] Thomas, W.: Automata on infinite objects, in: Handbook of Theoretical Computer Science, Vol B: Formal Models and Semantics (J. van Leeuwen, Ed.), Elsevier Science Publishers, 1990, 133-192