Abstract


 
 
 This work presents an implementation in π-calculus of a subset of a C-like language called While.
 We codify booleans, integers and the statements of while : assig- nation, composition, if, skip and while.
 We study the relationship between precongruences in While andπ-calculus.
 
 

Highlights

  • 1 Introduction π-calculus is a calculus for communicating systems in which one can express processes which have changing structure

  • The structural operational semantics of W hile give us transitions for pairs Statement × State

  • The outline of the paper is as follows: section 2 presents notational conventions of the version of pi-calculus we use for the codification

Read more

Summary

Notational Conventions

1. When a communication need to carry no parameter, (the parameter does not matter, is not used after), we write: x.P in place of xy.P x.P in place of x(y).P. 2. We shall often omit .0 in an agent. 3. We shall often wish to allow input names to determine the course of computation.

Syntax
Codification of Arithmetic Expressions
Semantics of Booleans
Codification of Statements
Observation precongruences
Conclusions

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.