A complete equational axiomatization for prefix iteration

DOI10.1016/0020-0190(94)00163-4zbMath0938.68697OpenAlexW1977683351MaRDI QIDQ1342264

W. J. Fokkink

Publication date: 21 June 2000

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/2250

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items

An equational axiomatization for multi-exit iteration, Discrete time process algebra, Nonaxiomatisability of equivalences over finite state processes, Termination modulo equations by abstract commutation with an application to iteration, Axiomatizing flat iteration, SOS rule formats for idempotent terms and idempotent unary operators, Models of nondeterministic regular expressions, Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination, Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration, Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?, Non-regular iterators in process algebra, A complete equational axiomatization for MPA with string iteration

Cites Work

• A complete inference system for a class of regular behaviours
• A calculus of communicating systems
• Structured operational semantics and bisimulation as a congruence
• Process algebra for synchronous communication
• On the Forms of the Predicates in the Theory of Constructive Ordinals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item