Abstract
AbstractThis paper discusses a logical verificational theory GQOT for concurrent processes which communicate and synchronize by asynchronous message passing. In concurrent processes, especially, in distributed systems, each process acts independently, and yet one operation is done as a whole by communicating and synchronizing. Thus, regarding each process as having its own local time, we formalize each by a temporal theory QOT. Then regarding all the concurrent processes as a complete graph with each process as a node, we formalize it as space G. GQOT is the merge of G and QOT. In this paper we define this GQOT and, moreover, to make it more suitable for concurrent processes, introduce a sort of action, concept of interval‐time and an operator “next.” Then, we show the description and verification of the concurrent processes and its properties.
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.
