On the expressiveness of choice quantification

DOI10.1016/S0168-0072(02)00082-9MaRDI QIDQ1874242zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 1342208
• The Logic of Choice
• Processes and formalisms for unbounded choice
• scientific article; zbMATH DE number 1333607
• On the expressive power of CCS

Cites work

• scientific article; zbMATH DE number 1810494 (Why is no real title available?)
• scientific article; zbMATH DE number 3142195 (Why is no real title available?)
• scientific article; zbMATH DE number 3880670 (Why is no real title available?)
• scientific article; zbMATH DE number 4157900 (Why is no real title available?)
• scientific article; zbMATH DE number 3987347 (Why is no real title available?)
• scientific article; zbMATH DE number 3751028 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1296290 (Why is no real title available?)
• scientific article; zbMATH DE number 3894457 (Why is no real title available?)
• scientific article; zbMATH DE number 3248792 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3198011 (Why is no real title available?)
• A proof system for communicating processes with value-passing
• A symbolic approach to value-passing processes
• Algebraic process verification.
• Calculi for synchrony and asynchrony
• Computable processes and bisimulation equivalence
• Creative sets
• Model theory.
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On sequential composition, action prefixes and process prefix
• Process Algebra
• Process algebra for synchronous communication
• Real time process algebra
• Symbolic bisimulations
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The tree identify protocol of IEEE 1394 in \(\mu\)CRL

Cited in

(3)

• The Expressivity of Quantifying over Regions
• Comparing the expressiveness of the \(\pi \)-calculus and CCS
• Infinite choice and probability distributions. An open problem: the real hotel

Describes a project that uses

Uses Software

• LOTOS

This page was built for publication: On the expressiveness of choice quantification

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