A complete equational axiomatization for prefix iteration

DOI10.1016/0020-0190(94)00163-4MaRDI QIDQ1342264zbMATH OpenOpenAlexFDO

Authors Wan 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

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

Recommendations

• scientific article; zbMATH DE number 883892
• scientific article; zbMATH DE number 1113857
• Complete axiomatization for divergent-sensitive bisimulations in basic process algebra with prefix iteration
• A complete equational axiomatization for MPA with string iteration
• On the complete axiomatization for prefix iteration modulo observation congruence

Cites work

• A calculus of communicating systems
• A complete inference system for a class of regular behaviours
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 108434 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1479628 (Why is no real title available?)
• scientific article; zbMATH DE number 1555176 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• On the Forms of the Predicates in the Theory of Constructive Ordinals
• Process algebra for synchronous communication
• Structured operational semantics and bisimulation as a congruence

Cited in

(19)

• Independence of the equational axioms for iteration theories
• A complete equational axiomatization for MPA with string iteration
• An equational axiomatization for multi-exit iteration
• Nonaxiomatisability of equivalences over finite state processes
• Termination modulo equations by abstract commutation with an application to iteration
• Discrete time process algebra
• Axiomatizing prefix iteration with silent steps
• Models of nondeterministic regular expressions
• SOS rule formats for idempotent terms and idempotent unary operators
• scientific article; zbMATH DE number 1113857 (Why is no real title available?)
• Axiomatizations for the perpetual loop in process algebra
• scientific article; zbMATH DE number 883892 (Why is no real title available?)
• Embedding untimed into timed process algebra; the case for explicit termination
• A sound and complete abstraction for reasoning about parallel prefix sums
• Complete axiomatization for divergent-sensitive bisimulations in basic process algebra with prefix iteration
• On the complete axiomatization for prefix iteration modulo observation congruence
• Non-regular iterators in process algebra
• Axiomatizing flat iteration
• Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?

This page was built for publication: A complete equational axiomatization for prefix iteration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342264)