Abstract
This brief paper introduces a small anonymous formal system representing the core theory of concurrent object-based computing. Milner's π-calculus is its underlying formalism, but the original calculus is reinterpreted and reformulated to become a simple and powerful expression of concurrent object-based computing. We briefly describe its underlying computational framework, its syntax, transition rules, semantic equivalence, and its special properties concerning "naming", which makes this calculus unique among various concurrency formalisms.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
