We present algorithms to synthesize component-based systems that are safe and deadlock-free using priorities, which define stateless-precedence between enabled actions. Our core method combines the concept of faultlocalization (using safety-game) and fault-repair (using SAT for conflict resolution). For complex systems, we propose three complementary methods as preprocessing steps for priority ...

A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parallel system, some processors are bound to fail, disrupting message routing. Second, one must avoid deadlock configurations in which messages permanently block one another. We present an efficient, oblivious, and deadlock...

The subject matter of the study is the automated guided vehicle (AGV) operation synchronisation mechanisms in flexible manufacturing systems. The processes examination has to guarantee the collision-free and deadlock-free AGVs flow. The problem of determination of the rules coordinating access of the vehicles to the shared travel route intervals, ensuring the collision-free and deadlock-free ex...

Deadlocks are a rather undesirable situation in a highly automated flexible manufacturing system. Their occurrences often deteriorate the utilization of resources and may lead to catastrophic results in safety-critical systems. Graph theory, automata, and Petri nets are three important mathematical tools to handle deadlock problems in resource allocation systems. Particularly, Petri nets are co...

This paper presents deadlock prevention are use to solve the deadlock problem of flexible manufacturing systems (FMS). Petri nets have been successfully as one of the most powerful tools for modeling of FMS. Their modeling power and a mathematical arsenal supporting the analysis of the modeled systems stimulate the increasing interest in Petri nets. With the structural object of Petri nets, sip...

Automated guided vehicles (AGVs) are the most flexible means to transport materials among workstations of a flexible manufacturing system. Complex issues associated with the design of AGV control of these systems are conflict-free shortest path, minimum time motion planning and deadlock avoidance. This research presents an intelligent agent-based framework to overcome the inefficacies associate...

In interconnection networks, there are several problems related to deadlock. We shall address deadlocks in the context of modularity, shortest path routing in irregular networks and fault tolerance. Deadlock freedom in interconnection networks is not a modular issue. One cannot generally combine two or more deadlock free interconnection network configurations without introducing new deadlock pr...

Concurrency primitives play an important role in describing programs on parallel/distributed environments and also in writing interactive programs. Theoretical supports for concurrency primitives, however, have so far been very limited. Several type systems have been recently proposed through process calculi, but most of them do not solve inherent problems in concurrent programs: deadlock and n...

Most machines of the last generation of distributed memory parallel computers possess speci c routers which are used to exchange messages between non-neighboring nodes in the network. Among the several technologies, wormhole routing is usually prefered because it allows low channel-setup time, and reduces the dependency between latency and inter-node distance. However, wormhole routing is very ...

Verification and validation techniques have become popular in software and hardware development. They increase the confidence and potentially provide rich feedback on errors. However, with increasing complexity verification and validation techniques are more likely to contain errors themselves. In this paper we address the problem of guaranteeing the correctness of validation work with respect ...