A Generalization of ACP Using Belnap's Logic

DOI10.1016/J.ENTCS.2005.12.102zbMATH Open1316.68104OpenAlexW2126831319MaRDI QIDQ5262974FDOQ5262974

Alban Ponse, Mark B. van der Zwaag

Publication date: 10 July 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2005.12.102

zbMATH Keywords

many-valued logicprocess algebraBelnap's logicchoiceconditional compositionACP

Mathematics Subject Classification ID

Many-valued logic (03B50) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)
• Process algebra for synchronous communication
• Title not available (Why is that?)
• Title not available (Why is that?)
• On notation for ordinal numbers
• Kleene's three-valued logic and process algebra
• Title not available (Why is that?)
• A propositional logic with 4 values: true, false, divergent and meaningless
• Title not available (Why is that?)
• Process algebra with four-valued logic
• A Generalization of ACP Using Belnap's Logic

Cited In (4)

• The B4-valued propositional Belnap-Dunn logic1
• Process algebra and conditional composition
• A Generalization of ACP Using Belnap's Logic
• The \(\mathbf{B}_4\)-valued propositional logic with unary logical connectives \(\sim_1/\sim_2/\neg\)

This page was built for publication: A Generalization of ACP Using Belnap's Logic

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