Communicating Evolving Algebras (CROSBI ID 495324)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Glavan, Paola ; Rosenzweig, Dean
engleski
Communicating Evolving Algebras
We develop the first steps of a theory of concurrency within the framework of evolving algebras of Gurevich, with the aim of investigating its suitability for the role of a general framework for modeling concurrent computation. As a basic tool we introduce a `modal' logic of transition rules and runs, which is, in the context of evolving algebras, just a definitional extension of ordinary first order logic. A notion of independence of rules and runs enables us to introduce a notion of (and notation for) concurrent runs, on which a logical theory of (`true') concurrency may be based. The notion of concurrent run also has (but does not depend on) an interleaving interpretation. Some basic constructs (concurrent composition, addition of guards and updates) and some derived constructs (internal and external choice, sequential composition) on evolving algebras are introduced and investigated. The power of the framework is demonstrated by developing simple and transparent evolving algebra models for the Chemical Abstract Machine of Berry and Boudol and for the $\pi$--calculus of Milner. Their respective notions of pa\-ra\-llelism map directly and faithfully to the native concurrency of evolving algebras.
distributed evolving algebras; pi-calculus; chemical abstract machines
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
182-215-x.
1993.
objavljeno
Podaci o matičnoj publikaciji
Computer Science Logic
E. Boerger, H. Kleine Buenning, G. Jaeger, S. Martini, M.M. Richter
Berlin: Springer
Podaci o skupu
Computer Science Logic
predavanje
01.01.1993-01.01.1993
San Miniato, Italija