Axiomatizations for the perpetual loop in process algebra

DOI10.1007/3-540-63165-8_212zbMath1401.68225OpenAlexW1817458133MaRDI QIDQ4571987

W. J. 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)

Related Items (max. 100)

SOS rule formats for idempotent terms and idempotent unary operators ⋮ Unnamed Item ⋮ Bochvar-McCarthy logic and process algebra ⋮ A Finite Axiomatization of Nondeterministic Regular Expressions ⋮ Non-regular iterators in process algebra ⋮ Process algebra with four-valued logic ⋮ A complete equational axiomatization for MPA with string iteration ⋮ Program algebra for sequential code

Uses Software

• ToolBus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete inference system for a class of regular behaviours
• A completeness theorem for Kleene algebras and the algebra of regular events
• An equational axiomatization for multi-exit iteration
• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
• Axiomatizing prefix iteration with silent steps
• Decidability of bisimulation equivalence for process generating context-free languages
• Process algebra for synchronous communication
• A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
• Two Complete Axiom Systems for the Algebra of Regular Events

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