Communicating Evolving Algebras

We develop the rst 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 de nitional extension of ordinary rst 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 evolvbra models for the ...

• Type: Conference
• Year: 1992
• Where: CSL
• Authors: Paola Glavan, Dean Rosenzweig
• Keywords: Automated Reasoning, Concurrent Run, Constructs Concurrent Composition, CSL 1992, Evolving Algebras