On the expressiveness of choice quantification

DOI10.1016/S0168-0072(02)00082-9zbMath1026.03018OpenAlexW2148143656MaRDI QIDQ1874242

Bas Luttik

Publication date: 22 May 2003

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(02)00082-9

zbMATH Keywords

process algebraschoice quantifiersinput prefix mechanismtransition trees

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Word problems, etc. in computability and recursion theory (03D40)

Related Items

Comparing the expressiveness of the \(\pi \)-calculus and CCS

Uses Software

• LOTOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symbolic bisimulations
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Calculi for synchrony and asynchrony
• The tree identify protocol of IEEE 1394 in \(\mu\)CRL
• A proof system for communicating processes with value-passing
• Model theory.
• On sequential composition, action prefixes and process prefix
• Computable processes and bisimulation equivalence
• Real time process algebra
• Process algebra for synchronous communication
• Process Algebra
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Creative sets