Proof of a Real-Time Mutual-Exclusion Algorithm
نویسندگان
چکیده
Michael Fischer has proposed a mutual exclusion algorithm that ingeniously exploits real time. We prove this algorithm using the time-honored technique of establishing an appropriate invariant.
منابع مشابه
Proof of a Real - Time Mutual - Exclusion AlgorithmNotes on UNITY : 32 { 92
Michael Fischerr2] has proposed a mutual exclusion algorithm that ingeniously exploits real time. We prove this algorithm using the time-honored technique of establishing an appropriate invariant.
متن کاملCompositional Veri cation of Real - time Systems
This paper presents a compositional proof system for the veriication of real-time systems. Real-time systems are modeled as timed transition modules, which explicitly model interaction with the environment and may be combined using composition operators. Composition rules are devised such that the correct-ness of a system may be determined from the correct-ness of its components. These proof ru...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملAALBORGUNIVERSITY ISSN1397{8640 FredrikBajersVej7E,9220Aalborgst,Denmark INSTITUTEFORCOMPUTERSCIENCE f Abstraction-BasedVericationofDistributed PhDthesis Systems
This thesis presents abstraction-based proof methods and practical abstraction strategies to support the integration of theorem proving and model checking methods in veri cation of distributed systems. The thesis is in two parts. In the rst part we present abstraction frameworks for untimed systems described as I/O automata and for real-time systems described as timed automata. The frameworks p...
متن کاملMutual exclusion by four shared bits with not more than quadratic complexity
For years, the mutual exclusion algorithm of Lycklama and Hadzilacos (1991) was the optimal mutual exclusion algorithm with the first-comefirst-served property, with a minimal number of (non-atomic) communication variables (5 bits per thread). Recently, Aravind published an improvement of it, which uses 4 bits per threads and has simplified waiting conditions. This algorithm is extended here wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Processing Letters
دوره 6 شماره
صفحات -
تاریخ انتشار 1996