Axiomatizations for the perpetual loop in process algebra

DOI10.1007/3-540-63165-8_212MaRDI QIDQ4571987zbMATH OpenOpenAlexFDO

Authors Wan Fokkink

Publication date 4 July 2018

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63165-8_212

Mathematics Subject Classification ID

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

Recommendations

• An equational axiomatization for multi-exit iteration
• A complete equational axiomatization for MPA with string iteration
• scientific article; zbMATH DE number 883892
• A complete equational axiomatization for prefix iteration
• Axiomatizing prefix iteration with silent steps

Cites work

• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
• A complete inference system for a class of regular behaviours
• A completeness theorem for Kleene algebras and the algebra of regular events
• A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
• An equational axiomatization for multi-exit iteration
• Axiomatizing prefix iteration with silent steps
• Decidability of bisimulation equivalence for process generating context-free languages
• scientific article; zbMATH DE number 3958712 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 1113856 (Why is no real title available?)
• scientific article; zbMATH DE number 1555176 (Why is no real title available?)
• Process algebra for synchronous communication
• Two Complete Axiom Systems for the Algebra of Regular Events

Cited in

(11)

• A complete equational axiomatization for MPA with string iteration
• An equational axiomatization for multi-exit iteration
• Program algebra for sequential code
• SOS rule formats for idempotent terms and idempotent unary operators
• Process algebra with four-valued logic
• A Finite Axiomatization of Nondeterministic Regular Expressions
• Modeling terms by graphs with structure constraints (two illustrations)
• Bochvar-McCarthy logic and process algebra
• Non-regular iterators in process algebra
• Milner's proof system for regular expressions modulo bisimilarity is complete. Crystallization: near-collapsing process graph interpretations of regular expressions
• From compactifying lambda-letrec terms to recognizing regular-expression processes (extended abstract and literature)

Describes a project that uses

Uses Software

• ToolBus

This page was built for publication: Axiomatizations for the perpetual loop in process algebra

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