π-calculus
E230807
The π-calculus is a formal mathematical model for describing and analyzing concurrent, communicating systems, particularly those with dynamic network structures.
All labels observed (8)
| Label | Occurrences |
|---|---|
| pi-calculus | 2 |
| π-calculus canonical | 2 |
| Pi-calculus | 1 |
| Robin Milner, Joachim Parrow, David Walker: "A Calculus of Mobile Processes" | 1 |
| asynchronous π-calculus | 1 |
| higher-order π-calculus | 1 |
| polyadic π-calculus | 1 |
| synchronous π-calculus | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2092390 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
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
Statements (52)
| Predicate | Object |
|---|---|
| instanceOf |
formal system
ⓘ
mathematical model of concurrency ⓘ process calculus ⓘ |
| basedOn | CCS (Calculus of Communicating Systems) ⓘ |
| coCreator |
David Walker
ⓘ
Joachim Parrow ⓘ |
| coreConcept |
channel (name)
ⓘ
input prefix ⓘ output prefix ⓘ parallel composition ⓘ process ⓘ replication or recursion ⓘ restriction (new name creation) ⓘ summation (choice) ⓘ |
| creator | Robin Milner ⓘ |
| field |
concurrency theory
ⓘ
process algebra ⓘ theoretical computer science ⓘ |
| hasEquivalence |
barbed bisimulation
ⓘ
bisimulation ⓘ observational equivalence ⓘ |
| hasFeature |
alpha-conversion of names
ⓘ
asynchronous communication (in variants) ⓘ channel passing ⓘ compositionality ⓘ dynamic communication topology ⓘ name mobility ⓘ operational semantics via labeled transition systems ⓘ scope extrusion ⓘ structural congruence ⓘ synchronous communication ⓘ |
| hasSemantics | operational semantics ⓘ |
| hasVariant |
π-calculus
self-linksurface differs
ⓘ
surface form:
asynchronous π-calculus
π-calculus self-linksurface differs ⓘ
surface form:
higher-order π-calculus
π-calculus self-linksurface differs ⓘ
surface form:
polyadic π-calculus
π-calculus self-linksurface differs ⓘ
surface form:
synchronous π-calculus
typed π-calculus ⓘ |
| influenced |
concurrent programming language design
ⓘ
join-calculus ⓘ mobile ambients ⓘ session types ⓘ spi-calculus ⓘ |
| notablePublication |
π-calculus
self-linksurface differs
ⓘ
surface form:
Robin Milner, Joachim Parrow, David Walker: "A Calculus of Mobile Processes"
|
| notation | Greek letter π (pi) ⓘ |
| publicationYear | early 1990s ⓘ |
| supports |
modeling of dynamic network topologies
ⓘ
modeling of mobile systems ⓘ reasoning about communication protocols ⓘ reasoning about process equivalence ⓘ |
| usedFor |
formal verification of concurrent systems
ⓘ
semantics of programming languages ⓘ specification of distributed algorithms ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: π-calculus Description of subject: The π-calculus is a formal mathematical model for describing and analyzing concurrent, communicating systems, particularly those with dynamic network structures.
Referenced by (10)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Pi-calculus
this entity surface form:
synchronous π-calculus
this entity surface form:
asynchronous π-calculus
this entity surface form:
polyadic π-calculus
this entity surface form:
higher-order π-calculus
this entity surface form:
Robin Milner, Joachim Parrow, David Walker: "A Calculus of Mobile Processes"
subject surface form:
CCS
this entity surface form:
pi-calculus
subject surface form:
CCS
this entity surface form:
pi-calculus