Fixed points in free process algebras. I

DOI10.1016/0304-3975(89)90010-8zbMath0679.68046OpenAlexW4213170797MaRDI QIDQ1822946

David B. Benson, Jerzy Tiuryn

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90010-8

zbMATH Keywords

latticegrovefixed pointspolynomialsprocess algebras

Mathematics Subject Classification ID

Partial orders, general (06A06) Trees (05C05) Abstract data types; algebraic specification (68Q65)

Related Items (6)

Algebraic solutions to recursion schemes ⋮ A completeness theorem for nondeterministic Kleene algebras ⋮ The equational logic of fixed points ⋮ Fixed points in free process algebras. II ⋮ Models of nondeterministic regular expressions ⋮ Bisimulation of automata

Cites Work

• Fixed point equations with parameters in the projective model
• Algebra of communicating processes with abstraction
• A calculus of communicating systems
• Seminearrings, seminearfields and their semigroup-theoretical background
• Process algebra for synchronous communication
• Related representation theorems for rings, semi-rings, near-rings and semi-near-rings by partial transformations and partial endomorphisms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fixed points in free process algebras. I