Fixed points in free process algebras. I
type: Item
instance of: scholarly article
title: Fixed points in free process algebras. I
zbMATH Open document ID: 0679.68046
DOI: 10.1016/0304-3975(89)90010-8
author: David B. Benson
author: Jerzy Tiuryn
published in: Theoretical Computer Science
publication date: 1989-01-01T00:00:00Z
review text: The process algebras with constants A, \((P,A,+,\cdot,\delta,\tau)\), of type (2,2,0,0) are considered. The elements of P are called processes and the elements of A are called atomic actions. Let P(A)[X] denote free process algebra with constants A freely generated by the set X. Elements of the set P(A)[X] are called polynomials. The fixed point solutions for systems of iterative equations involving linear left simple polynomials are characterized and explicitly given.
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 06A06
zbMATH DE Number: 4113972
zbMATH Keywords: fixed points
zbMATH Keywords: grove
zbMATH Keywords: lattice
zbMATH Keywords: process algebras
zbMATH Keywords: polynomials
reviewed by: Boleslaw Wojdyło
MaRDI profile type: Publication
full work available at URL: 0304-3975(89)90010-8
OpenAlex ID: W4213170797
cites work: Q4083730
cites work: Process algebra for synchronous communication
cites work: Algebra of communicating processes with abstraction
cites work: Q3727367
cites work: Q3028334
cites work: Q3742698
cites work: Fixed point equations with parameters in the projective model
cites work: A calculus of communicating systems
cites work: Related representation theorems for rings, semi-rings, near-rings and semi-near-rings by partial transformations and partial endomorphisms
cites work: Seminearrings, seminearfields and their semigroup-theoretical background
cites work: Q4726424
description: scientific article; zbMATH DE number 4113972