Combining data type and recursive process specifications using projection algebras

DOI10.1016/0304-3975(90)90049-NzbMath0695.68015OpenAlexW2005828354MaRDI QIDQ910188

Martin Grosse-Rhode, Paul Boehm, Francesco Parisi-Presicce, Cristian Dimitrovici, Catharina Rieckhoff, Hartmut Ehrig

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90049-n

zbMATH Keywords

algebraic semanticsprocess algebrasprocess semanticsdata type specificationprocess specifications

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Data structures (68P05) General topics in the theory of software (68N01)

Related Items (7)

Functorial theory of parameterized specifications in a general specification framework ⋮ Quasi-injectivity of partially ordered acts ⋮ The connection between initial and unique solutions of domain equations in the partial order and metric approach ⋮ Down closed-quasi-injectivity of partially ordered acts ⋮ Denotational linear time semantics and sequential composition ⋮ Uniform Completion versus Ideal Completion of Posets with Projections ⋮ Quasi injectivity andθ-internal order sum in partially ordered acts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A uniform approach to inductive posets and inductive closure
• On the algebraic specification of infinite objects - ordered and continuous models of algebraic types
• Algebraic specification of modules and their basic interconnections
• A calculus of communicating systems
• Algebraic laws for nondeterminism and concurrency
• Initial Algebra Semantics and Continuous Algebras
• Processes and the denotational semantics of concurrency
• Completions of partially ordered sets and universal algebras

This page was built for publication: Combining data type and recursive process specifications using projection algebras