The real-time traffic control of railway networks authorizes movements of the trains and imposes safety constraints. The paper deals with the real time traffic control focusing on deadlock prevention problem. Colored Petri nets are used to model the dynamics of the railway network system: places represent tracks and stations, tokens are trains. The prevention policy is expressed by a set of lin...

In the problem of k-mutual exclusion, concurrent access to shared resource or the critical section (CS) must be synchronized such that at any time at most k processes can access the CS. In this paper, we propose a generalized grid quorum strategy for k-mutual exclusion, which imposes a logical grid structure on the network. The quorum size is always equal to (M + 1)/(k + 1) × (N + 1)/2 , where ...

A problem of designing conflict-free schedules for concurrent repetitive manufacturing processes using resources in mutual exclusion is considered. Processes that share resources can wait for resources (machines) required to complete successive operations in their production routes. Systems of processes sharing only one resource are considered. A problem of finding operation times and starting ...

We discuss the relationship between the classical Lagrange theorem in mathematics and the quantum statistical mechanics and thermodynamics of an ideal gas of multispecies quasiparticles with mutual fractional exclusion statistics. First, we show that the thermodynamic potential and the density of the system are analytically expressed in terms of the language of generalized cluster expansions, w...

Dijkstra 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. Mutual exclusion algorithms for shared-memorymultiprocessors do not guarantee true mutual exclusion. We give a simple...

The prediction of energetically favorable sidechain conformations is a fundamental element in homology modeling of proteins and the design of novel protein sequences. The space of side-chain conformations can be approximated by a discrete space of probabilistically representative side-chain conformations (called rotamers). The problem is, then, to find a rotamer selection for each amino acid th...

One of the main challenges for protein redesign is the efficient evaluation of a combinatorial number of candidate structures. The modeling of protein flexibility, typically by using a rotamer library of commonly-observed low-energy side-chain conformations, further increases the complexity of the redesign problem. A dominant algorithm for protein redesign is dead-end elimination (DEE), which p...

In this paper we study the problem of constraint transformation. We consider a special type of system in which the uncontrollable subnet is an assembly flow system, which is a subclass of backwardsynchronization-backward-conflict-free Petri net. We propose an algorithm to transform a given inadmissable GMEC into an equivalent admissible OR-GMEC. The algorithm is based on a technique that adds n...

A family of four mutual exclusion algorithms is presented. Its members vary from a simple three-bit linear wait mutual exclusion to the four-bit first-come firstserved algorithm immune to various faults. The algorithms are based on a scheme similar to the Morris’s solution of the mutual exclusion with three weak semaphores. The presented algorithms compare favorably with equivalent published mu...