Results 241 to 250 of about 482,704 (293)
Some of the next articles are maybe not open access.
1993
Our study of Petri net synthesis for manufacturing systems begins with the classification of places in a Petri net model. The modeling approach in which places are used to model operation processes and the availability of resources, and in which transitions are used to model the start and/or end of operations makes such a distinction among places ...
MengChu Zhou, Frank DiCesare
openaire +1 more source
Our study of Petri net synthesis for manufacturing systems begins with the classification of places in a Petri net model. The modeling approach in which places are used to model operation processes and the availability of resources, and in which transitions are used to model the start and/or end of operations makes such a distinction among places ...
MengChu Zhou, Frank DiCesare
openaire +1 more source
Mutual Exclusion on a Hypercube
Journal of Parallel and Distributed Computing, 1993We present a decentralized, symmetric mutual exclusion algorithm that is tailored to the hypercube architecture. Our algorithm has better time complexity than a suitable hypercube adaptation of \textit{Maekawa}'s \(O(\sqrt N)\) Mutual Exclusion algorithm [A Sqrt(N) algorithm for mutual exclusion in decentralized systems, ACM Trans. Comput. Syst. 3, No.
Gupta, Ajay +2 more
openaire +2 more sources
When does a correct mutual exclusion algorithm guarantee mutual exclusion?
Information Processing Letters, 2000Dijkstra introduced mutual exclusion for an N -process system as the requirement “that at any moment only one of these N cyclic processes is in its critical section” [1]. This requirement, which we call true mutual exclusion, is still the standard definition of mutual exclusion.
Lamport, Leslie +2 more
openaire +2 more sources
Closing the complexity gap between mutual exclusion and FCFS mutual exclusion
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, 2008We consider the worst-case remote memory reference (RMR) complexity of first-come-first-served (FCFS) mutual exclusion (ME) algorithms for N asynchronous reliable processes that communicate only by reading and writing shared memory. We exhibit an upper bound of O(log N) RMRs for FCFS ME, which is tight, improves on prior results, and matches a lower ...
Robert Danek, Wojciech Golab
openaire +1 more source
1993
Applications of Petri net theory have been extended to various aspects of manufacturing since its introduction to this domain in the 1970’s. Among them are specification, validation, performance analysis, and simulation for automated manufacturing systems [Al-Jaar 90a; Desrochers 89; DiCesare 91; Murata 89; Silva 90; Zhou 90a].
MengChu Zhou, Frank DiCesare
openaire +1 more source
Applications of Petri net theory have been extended to various aspects of manufacturing since its introduction to this domain in the 1970’s. Among them are specification, validation, performance analysis, and simulation for automated manufacturing systems [Al-Jaar 90a; Desrochers 89; DiCesare 91; Murata 89; Silva 90; Zhou 90a].
MengChu Zhou, Frank DiCesare
openaire +1 more source
Mutually Exclusive Transcription
Science Signaling, 2012Cis-regulatory elements ensure that the expression domains of two patterning signals do not overlap.
openaire +1 more source
2012
This chapter is on the implementation of mutual exclusion locks. As announced at the end of the previous chapter, it presents three distinct families of algorithms that solve the mutual exclusion problem. The first is the family of algorithms which are based on atomic read/write registers only.
openaire +1 more source
This chapter is on the implementation of mutual exclusion locks. As announced at the end of the previous chapter, it presents three distinct families of algorithms that solve the mutual exclusion problem. The first is the family of algorithms which are based on atomic read/write registers only.
openaire +1 more source
Superstabilizing mutual exclusion
Distributed Computing, 2000A superstabilizing protocol is a protocol that (i) is self-stabilizing, meaning that it can recover from an arbitrarily severe transient fault; and (ii) can recover from a local transient fault while satisfying a passage predicate during recovery. This paper investigates the possibility of superstabilizing protocols for mutual exclusion in a ring of ...
openaire +1 more source
1997
This chapter describes a project accomplished by Jens B. Jorgensen and Lars M. Kristensen, Aarhus University, Denmark. The chapter is based upon the material presented in [34]. The project was conducted in 1996.
openaire +1 more source
This chapter describes a project accomplished by Jens B. Jorgensen and Lars M. Kristensen, Aarhus University, Denmark. The chapter is based upon the material presented in [34]. The project was conducted in 1996.
openaire +1 more source