Abstract
We try to develop a deeper understanding of “concurrent computations” by stating a precise and formalized conception of a realization of a concurrent computation. Within this formal apparatus we can present exact mathematical proofs for certain hierarchies of concurrent systems. As the following systems have a modular structure they might be helpful for a further theory of very fast hardware circuits without a global synchronizing clock.
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.
