π-calculus

Target entity: π-calculus
Context triple: [Robin Milner, knownFor, π-calculus]

• A. CSP (Communicating Sequential Processes)
  CSP (Communicating Sequential Processes) is a formal model for describing and analyzing concurrent systems based on independent processes that interact solely through message-passing communication.
• B. Hoare logic
  Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
• C. lambda calculus
  Lambda calculus is a formal system in mathematical logic and computer science that uses function abstraction and application to investigate computation and serves as a foundational model for programming languages.
• D. Computing with Register Machines
  "Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
• E. Communication Nets: Stochastic Message Flow and Delay
  "Communication Nets: Stochastic Message Flow and Delay" is a foundational book in queueing theory and computer networking that rigorously analyzes message traffic and delays in communication networks.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: π-calculus
Target entity description: The π-calculus is a formal mathematical model for describing and analyzing concurrent, communicating systems, particularly those with dynamic network structures.

• A. CSP (Communicating Sequential Processes)
  CSP (Communicating Sequential Processes) is a formal model for describing and analyzing concurrent systems based on independent processes that interact solely through message-passing communication.
• B. Hoare logic
  Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
• C. lambda calculus
  Lambda calculus is a formal system in mathematical logic and computer science that uses function abstraction and application to investigate computation and serves as a foundational model for programming languages.
• D. Computing with Register Machines
  "Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
• E. Communication Nets: Stochastic Message Flow and Delay
  "Communication Nets: Stochastic Message Flow and Delay" is a foundational book in queueing theory and computer networking that rigorously analyzes message traffic and delays in communication networks.
• F. None of above. chosen