Skip to search formSkip to main contentSkip to account menu

Π-calculus

Known as: Pi-calculus, Π calculus, Calculus (disambiguation) 
In theoretical computer science, the π-calculus (or pi-calculus) is a process calculus. The π-calculus allows channel names to be communicated along… 
Wikipedia (opens in a new tab)

Related topics

Related topics

22 relations
API-CalculusAbstract syntaxAndrew D. GordonBisimulation

Broader (1)

Theoretical computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
ABS: A Core Language for Abstract Behavioral Specification
This paper presents ABS, an abstract behavioral specification language for designing executable models of distributed object… 
Highly Cited
2008
Highly Cited
2008
The π-Calculus: A theory of mobile processes
  • R. Ahmad
  • Scalable Computing : Practice and Experience
  • 2008
  • Corpus ID: 2772704
Highly Cited
2005
Highly Cited
2005
Free-Algebra Models for the pi-Calculus
The finite @p-calculus has an explicit set-theoretic functor-category model that is known to be fully abstract for strong late… 
Highly Cited
2004
Highly Cited
2004
π-ADL: an Architecture Description Language based on the higher-order typed π-calculus for specifying dynamic and mobile software architectures
A key aspect of the design of any software system is its architecture. An architecture description, from a runtime perspective… 
Highly Cited
2004
Highly Cited
2004
Beta Binders for Biological Interactions
This paper presents binders and operators, in the process calculi tradition, to reason about biological interactions. Special… 
Highly Cited
2002
Highly Cited
2002
A New Approach to Abstract Syntax with Variable Binding
Abstract. The permutation model of set theory with atoms (FM-sets), devised by Fraenkel and Mostowski in the 1930s, supports… 
Highly Cited
2000
Highly Cited
2000
Pict: a programming language based on the Pi-Calculus
The -calculus o ers an attractive basis for concurrent programming. It is small, elegant, and well studied, and supports (via… 
Highly Cited
1998
Highly Cited
1998
Interactive Foundations of Computing
Highly Cited
1998
Highly Cited
1998
Reasoning about The Past with Two-Way Automata
The Μ-calculus can be viewed as essentially the “ultimate” program logic, as it expressively subsumes all propositional program… 
Highly Cited
1993
Highly Cited
1993
Typing and subtyping for mobile processes
The pi -calculus is a process algebra that supports process mobility by focusing on the communication of channels. R. Milner's… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)