Kleene's three-valued logic and process algebra

DOI10.1016/S0020-0190(98)00083-0zbMath1338.68200MaRDI QIDQ293327

Jan A. Bergstra, Alban Ponse

Publication date: 9 June 2016

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

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098000830?np=y

zbMATH Keywords

process algebra; design of algorithms; three-valued logic; formal languages; concurrency; guarded command

Mathematics Subject Classification ID

68Q55: Semantics in the theory of computing

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

03B50: Many-valued logic

Related Items

Process algebra with four-valued logic, A Generalization of ACP Using Belnap's Logic, A generalization of ACP using Belnap's logic, An algebraic expression of finite horizon optimal control algorithm for stochastic logical dynamical systems, The \(\mathbf{B}_4\)-valued propositional logic with unary logical connectives \(\sim_1/\sim_2/\neg\), Combining programs and state machines

Cites Work

• Unnamed Item
• A logic covering undefinedness in program proofs
• Structured operational semantics and bisimulation as a congruence
• A typed logic of partial functions reconstructed classically
• Process algebra with propositional signals
• Process algebra for synchronous communication
• A Theory of Communicating Sequential Processes
• Ten Years of Hoare's Logic: A Survey—Part I
• Process Algebra
• Programming as a Discipline of Mathematical Nature
• A propositional logic with 4 values: true, false, divergent and meaningless
• Lattices With Involution
• On notation for ordinal numbers