Log in

Relevant bibliographies by topics / Artificial Deadlocks / Journal articles

To see the other types of publications on this topic, follow the link: Artificial Deadlocks.

Journal articles on the topic 'Artificial Deadlocks'

Author: Grafiati

Published: 4 June 2021

Last updated: 7 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Artificial Deadlocks.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

MANI, NARIMAN, VAHID GAROUSI, and BEHROUZ H. FAR. "SEARCH-BASED TESTING OF MULTI-AGENT MANUFACTURING SYSTEMS FOR DEADLOCKS BASED ON MODELS." International Journal on Artificial Intelligence Tools 19, no. 04 (2010): 417–37. http://dx.doi.org/10.1142/s0218213010000261.

Full text

Abstract:

Multi-Agent Systems (MAS) have been extensively used in the automation of manufacturing systems. However, similar to other distributed systems, autonomous agents' interaction in the Automated Manufacturing Systems (AMS) can potentially lead to runtime behavioral failures including deadlocks. Deadlocks can cause major financial consequences by negatively affecting the production cost and time. Although the deadlock monitoring techniques can prevent the harmful effects of deadlocks at runtime, but the testing techniques are able to detect design faults during the system design and development stages that can potentially lead to deadlock at runtime. In this paper, we propose a search based testing technique for deadlock detection in multi-agent manufacturing system based on the MAS design models. MAS design artifacts, constructed using Multi-agent Software Engineering (MaSE) methodology, are used for extracting test requirements for deadlock detection. As the case study, the proposed technique is applied to a multi-agent manufacturing system for verifying its effectiveness. A MAS simulator has been developed to simulate multi-agent manufacturing system behavior under test and the proposed testing technique has been implemented in a test requirement generator tool which creates test requirements based on the given design models.

APA, Harvard, Vancouver, ISO, and other styles

2

Pan, Yen-Liang. "One Computational Innovation Transition-Based Recovery Policy for Flexible Manufacturing Systems Using Petri nets." Applied Sciences 10, no. 7 (2020): 2332. http://dx.doi.org/10.3390/app10072332.

Full text

Abstract:

In the third and fourth industrial revolutions, smart or artificial intelligence flexible manufacturing systems (FMS) seem to be the key machine equipment for capacity of factory production. However, deadlocks could hence appear due to resources competition between robots. Therefore, how to prevent deadlocks of FMS occurring is a very important and hot issue. Based on Petri nets (PN) theory, in existing literature almost all research adopts control places as their deadlock prevention mean. However, under this strategy the real optimal reachable markings are not achieved even if they claimed that their control policy is maximally permissive. Accordingly, in this paper, the author propose one novel transition-based control policy to solve the deadlock problem of FMS. The proposed control policy could also be viewed as deadlock recovery since it can recover all initial deadlock and quasi-deadlock markings. Furthermore, control transitions can be calculated and obtained once the proposed three-dimension matrix, called generating and comparing aiding matrix (GCAM) in this paper, is built. Finally, an iteration method is used until all deadlock markings become live ones. Experimental results reveal that our control policy seems still the best one among all existing methods in the literature regardless of whether these methods belong to places or transitions based.

APA, Harvard, Vancouver, ISO, and other styles

3

HALLERSTEDE, STEFAN, and MICHAEL LEUSCHEL. "Constraint-based deadlock checking of high-level specifications." Theory and Practice of Logic Programming 11, no. 4-5 (2011): 767–82. http://dx.doi.org/10.1017/s1471068411000299.

Full text

Abstract:

AbstractEstablishing the absence of deadlocks is important in many applications of formal methods. The use of model checking for finding deadlocks in formal models is often limited. In this paper, we propose a constraint-based approach to finding deadlocks employing the ProB constraint solver. We present the general technique, as well as various improvements that had to be performed on ProB's Prolog kernel, such as reification of membership and arithmetic constraints. This work was guided by an industrial case study, where a team from Bosch was modelling a cruise control system. Within this case study, ProB was able to quickly find counterexamples to very large deadlock-freedom constraints. In the paper, we also present other successful applications of this new technique. Experiments using SAT and SMT solvers on these constraints were thus far unsuccessful.

APA, Harvard, Vancouver, ISO, and other styles

4

SLIVA, VLADIMIR P., TADAO MURATA, and SOL M. SHATZ. "PROTOCOL SPECIFICATION DESIGN USING AN OBJECT-BASED PETRI NET FORMALISM." International Journal of Software Engineering and Knowledge Engineering 09, no. 01 (1999): 97–125. http://dx.doi.org/10.1142/s0218194099000073.

Full text

Abstract:

This paper presents a method for modeling of communication protocols using G-Nets — an object-based Petri net formalism. Our approach focuses on specification of one entity in one node at one time, with the analysis that allows consideration of other layers and nodes in addition to module analysis. We extend G-Nets by the notion of timers, which aids the construction of protocol software models. Our method prevents some types of potential deadlocks and livelocks from being introduced into the produced net models. We present certain net synthesis rules to prevent some potential design errors by including error cases in the model. Thus, our node (site) interplay modeling includes cases in which a message may arrive corrupted or can be lost entirely before it would get to its destination node. Also, since our models have deadlock-preserving skeletons, the verification of global deadlock non-existence can be performed on the less complex skeleton rather than on the full G-Net model. Our analysis method discovers some deadlocks plus other unacceptable markings, which do not allow restoration of the initial state. Finding potential livelocks or overspecification is also a part of the analysis.

APA, Harvard, Vancouver, ISO, and other styles

5

Rudy, Jarosław, Radosław Idzikowski, Elzbieta Roszkowska, and Konrad Kluwak. "Multiple Mobile Robots Coordination in Shared Workspace for Task Makespan Minimization." Processes 10, no. 10 (2022): 2087. http://dx.doi.org/10.3390/pr10102087.

Full text

Abstract:

In this paper we consider a system of multiple mobile robots (MMRS) and the process of their concurrent motion in a shared two-dimensional workspace. The goal is to plan the robot movement along given fixed paths so as to minimize the completion time of all the robots while ensuring that they never collide. Thus, the considered problem combines the problems of robot schedule optimization with collision and deadlock avoidance. The problem formulation is presented and its equivalent reformulation that does not depend explicitly on the geometry of the robot paths is proposed. An event-based solution representation is proposed, allowing for a discrete optimization approach. Two types of possible deadlocks are identified and deadlock avoidance procedures are discussed. We proposed two types of solving methods. First, we implemented two metaheuristics: the local-search-based taboo search as well as the population-based artificial bee colony. Next, we implemented 14 simple constructive algorithms, employing dispatch rules such as first-in first-out, shortest distance remaining first, and longest distance remaining first, among others. A set of problem instances for different numbers of robots is created and provided as a benchmark. The effectiveness of the solving methods is then evaluated by simulation using the generated instances. Both deterministic and lognormal-distributed uncertain robot travel times are considered. The results prove that the taboo search metaheuristic obtained the best results for both deterministic and uncertain cases, with only artificial bee colony and a few constructive algorithms managing to remain competitive. Detailed results as well as ideas to further improve proposed methods are discussed.

APA, Harvard, Vancouver, ISO, and other styles

6

Li, Jie, Runfeng Chen, and Ting Peng. "A Distributed Task Rescheduling Method for UAV Swarms Using Local Task Reordering and Deadlock-Free Task Exchange." Drones 6, no. 11 (2022): 322. http://dx.doi.org/10.3390/drones6110322.

Full text

Abstract:

Distributed task scheduling is an ongoing concern in the field of multi-vehicles, especially in recent years; UAV swarm performing complex tasks endows it with new characteristics, such as self-organization, scalability, reconfigurability, etc. This requires the swarm to have distributed rescheduling capability to dynamically include as many unassigned tasks or new tasks as possible, while satisfying tight time constraints. As one of the most advanced rescheduling methods, the Performance Impact (PI)-MaxAss algorithm provides an important reference for this paper. However, its task exchange-based strategy faces the deadlock problem, and the task rescheduling method should not be limited to this. To this end, a new distributed rescheduling method is proposed for UAV swarms, which combines the local task reordering strategy and the improved task exchange strategy. On the one hand, based on the analysis of the fact that the scheduler is unreasonable for individuals, this paper proposes a local task reordering strategy denoted as PI-Reorder, which simply adds the reordering strategy to the recursive inclusion phase of the PI-MinAvg algorithm, so that unassigned tasks or new tasks can be included without relying on the task exchange. On the other hand, from the phenomenon that two or more vehicles occasionally get caught in an infinite cycle of exchanging the same tasks, the deadlock problem of PI-MaxAss is analyzed, which is then solved by introducing a deadlock-free task exchange strategy, where some defined counters are used to detect and isolate the deadlocks. Then, a rescue scenario is used to demonstrate the performance of the proposed methods, PI-Hybrid compared with PI-MaxAss. Monte Carlo simulation results show that, compared with PI-MaxAss, this method can not only increase the number of allocations to varying degrees, but also reduce the average waiting time, while ensuring deadlock avoidance. The methods can be used not only for the secondary optimization of the existing task exchange scheduling algorithms to escape local optima, but also for task reconfiguration of swarm tasks after adding or removing tasks.

APA, Harvard, Vancouver, ISO, and other styles

7

Lee, Soojung, and Kil Hong Joo. "Efficient detection and resolution of OR deadlocks in distributed systems." Journal of Parallel and Distributed Computing 65, no. 9 (2005): 985–93. http://dx.doi.org/10.1016/j.jpdc.2005.01.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Ryang, D. S., and K. H. Park. "A Two-Level Distributed Detection Algorithm of AND/OR Deadlocks." Journal of Parallel and Distributed Computing 28, no. 2 (1995): 149–61. http://dx.doi.org/10.1006/jpdc.1995.1096.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Arafeh, Bassel R. "A task duplication scheme for resolving deadlocks in clustered DAGs." Parallel Computing 29, no. 6 (2003): 795–820. http://dx.doi.org/10.1016/s0167-8191(03)00059-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Wang, Xiaohang, Peng Liu, Mei Yang, and Yingtao Jiang. "Avoiding request–request type message-dependent deadlocks in networks-on-chips." Parallel Computing 39, no. 9 (2013): 408–23. http://dx.doi.org/10.1016/j.parco.2013.05.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Dang, Kim, and Ronan Champagnat. "An Authoring Tool to Derive Valid Interactive Scenarios." Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment 9, no. 4 (2021): 9–15. http://dx.doi.org/10.1609/aiide.v9i4.12620.

Full text

Abstract:

In recent years, many tools have been proposed to design interactive scenarios. The aim of these tools is to provide users with a framework in order to write a story with many branches which will be unfolded by an artificial intelligence application. However, the consistency and quality of the generated narratives are not guaranteed (deadlocks, flaws, etc.). Previous work has defined the properties of a valid interactive scenario and proposed an approach as well as a tool based on a formal model, Linear Logic, to validate these properties. Nevertheless, the application of this tool requires many special skills and so is not really suitable for normal users. In this paper, we present an authoring tool which allows modeling interactive scenarios and analysing them at the structural level using the deduction rules in Linear Logic. Thanks to our tool, normal users are able to create and validate interactive scenarios in comparison with a rich set of predefined properties/criteria of quality.

APA, Harvard, Vancouver, ISO, and other styles

12

SARNA-STAROSTA, BEATA, R. E. K. STIREWALT, and LAURA K. DILLON. "A MODEL-BASED DESIGN-FOR-VERIFICATION APPROACH TO CHECKING FOR DEADLOCK IN MULTI-THREADED APPLICATIONS." International Journal of Software Engineering and Knowledge Engineering 17, no. 02 (2007): 207–30. http://dx.doi.org/10.1142/s0218194007003197.

Full text

Abstract:

This paper explores an approach to design for verification in systems built atop a middleware framework which separates synchronization concerns from the "core-functional logic" of a program. The framework is based on a language-independent compositional model of synchronization contracts, called Szumo, which integrates well with popular OO design artifacts and provides strong guarantees of non-interference for a class of strictly exclusive systems. An approach for extracting models from Szumo design artifacts and analyzing the generated models to detect deadlocks is described. A key decision was to use Constraint Handling Rules to express the semantics of synchronization contracts, which allowed a transparent model of the implementation logic.

APA, Harvard, Vancouver, ISO, and other styles

13

Tsvetkova, Anna Denisovna. "Investigator's Intuition: Conditions of Formation and the Possibility of Implementation of Artificial Intelligence." Полицейская и следственная деятельность, no. 3 (March 2022): 22–30. http://dx.doi.org/10.25136/2409-7810.2022.3.38740.

Full text

Abstract:

The paper examines the issues of intuition in investigative practice. Relying on the positions of prominent forensic scientists, the importance of this heuristic mechanism for overcoming deadlocks caused not only by a shortage of information, but also by its overabundance is substantiated. The author suggests mechanisms for the development of intuition, the main of which is called the expansion of erudition, the accumulation of a large number of background knowledge. The second part of the article discusses the problems of artificial intelligence. Firstly, the topic of its potential to replace a person is covered. Secondly, the position existing in science is refuted, according to which the work of artificial neural networks is characterized as intuitive. Based on the analysis of practical examples and the synthesis of various scientific positions, the author formulated the following conclusions: 1. The intuitive decisions based on the probabilistic assumption assist the investigator in choosing specific investigative actions or tactics for their conduct. 2. Intuition is best developed among investigators with average work experience and broad erudition. 3. Intuition can and should be developed, mainly by expanding erudition, accumulating background experience. 4. The work of artificial neural networks cannot be called completely intuitive, since they act according to a given algorithm, even if generating a solution that is not accessible to human perception, whereas intuition is a creative process that goes beyond standard models. 5. To date, there is only a weak artificial intelligence, which is able to cover only situations of an overabundance of information, but not its deficit, although the latter very often require an appeal to intuition. 6. Intuition is a competitive advantage of humans over artificial intelligence, allowing our species to think more broadly, more versatile.

APA, Harvard, Vancouver, ISO, and other styles

14

Park, Jong Hyuk, Hyoung Joong Kim, and Chulung Lee. "Ubiquitous software controller to prevent deadlocks for automated guided vehicle systems in a container port terminal environment." Journal of Intelligent Manufacturing 20, no. 3 (2009): 321–25. http://dx.doi.org/10.1007/s10845-008-0212-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Wesselhöft, Mike, Johannes Hinckeldeyn, and Jochen Kreutzfeldt. "Controlling Fleets of Autonomous Mobile Robots with Reinforcement Learning: A Brief Survey." Robotics 11, no. 5 (2022): 85. http://dx.doi.org/10.3390/robotics11050085.

Full text

Abstract:

Controlling a fleet of autonomous mobile robots (AMR) is a complex problem of optimization. Many approached have been conducted for solving this problem. They range from heuristics, which usually do not find an optimum, to mathematical models, which are limited due to their high computational effort. Machine Learning (ML) methods offer another potential trajectory for solving such complex problems. The focus of this brief survey is on Reinforcement Learning (RL) as a particular type of ML. Due to the reward-based optimization, RL offers a good basis for the control of fleets of AMR. In the context of this survey, different control approaches are investigated and the aspects of fleet control of AMR with respect to RL are evaluated. As a result, six fundamental key problems should be put on the current research agenda to enable a broader application in industry: (1) overcoming the “sim-to-real gap”, (2) increasing the robustness of algorithms, (3) improving data efficiency, (4) integrating different fields of application, (5) enabling heterogeneous fleets with different types of AMR and (6) handling of deadlocks.

APA, Harvard, Vancouver, ISO, and other styles

16

Курленя, Константин Михайлович. "The Search for Meaning in Music: Scientific Breakthroughs and Deadlocks. Analytical Review of Selected Achievements of Musical Cognitive Science." Научный вестник Московской консерватории, no. 2(45) (June 23, 2021): 136–63. http://dx.doi.org/10.26176/mosconsv.2021.45.2.007.

Full text

Abstract:

В статье анализируются опыт отечественного и зарубежного когнитивного музыкознания, теоретические основы формализации музыкального мышления и возможности его представления в виде алгоритмов, необходимых для моделирования искусственного интеллекта в сфере музыкальной деятельности. Отмечаются различия в способах нахождения и формулирования смысла, возможностях оценки его истинности или ложности, в процессах личностного понимания и его алгоритмического представления. Указывается, что развитие когнитивного музыкознания приводит к необходимости формирования и применения новых междисциплинарных стратегий научного поиска. Основные тенденции музыкальной когнитивистики обусловлены универсальностью парадигм мышления и перспективами их формализации. The article analyzes the experience of domestic and foreign cognitive musicology, the theoretical foundations of the formalization of musical thinking and the possibility of its presentation in the form of algorithms necessary for modeling artificial intelligence in the field of musical activity. Differences are noted in the methods of finding and formulating the meaning, the possibilities of assessing its truth or falsity, in the processes of personal understanding and its algorithmic presentation. It is indicated that the development of cognitive musicology leads to the need for the formation and application of new interdisciplinary strategies for scientific research. The main trends in musical cognitive science are due to the universality of the paradigms of thinking and the perspectives of their formalization.

APA, Harvard, Vancouver, ISO, and other styles

17

Falcó, Antonio, Lucía Hilario, Nicolás Montés, Marta C. Mora, and Enrique Nadal. "A Path Planning Algorithm for a Dynamic Environment Based on Proper Generalized Decomposition." Mathematics 8, no. 12 (2020): 2245. http://dx.doi.org/10.3390/math8122245.

Full text

Abstract:

A necessity in the design of a path planning algorithm is to account for the environment. If the movement of the mobile robot is through a dynamic environment, the algorithm needs to include the main constraint: real-time collision avoidance. This kind of problem has been studied by different researchers suggesting different techniques to solve the problem of how to design a trajectory of a mobile robot avoiding collisions with dynamic obstacles. One of these algorithms is the artificial potential field (APF), proposed by O. Khatib in 1986, where a set of an artificial potential field is generated to attract the mobile robot to the goal and to repel the obstacles. This is one of the best options to obtain the trajectory of a mobile robot in real-time (RT). However, the main disadvantage is the presence of deadlocks. The mobile robot can be trapped in one of the local minima. In 1988, J.F. Canny suggested an alternative solution using harmonic functions satisfying the Laplace partial differential equation. When this article appeared, it was nearly impossible to apply this algorithm to RT applications. Years later a novel technique called proper generalized decomposition (PGD) appeared to solve partial differential equations, including parameters, the main appeal being that the solution is obtained once in life, including all the possible parameters. Our previous work, published in 2018, was the first approach to study the possibility of applying the PGD to designing a path planning alternative to the algorithms that nowadays exist. The target of this work is to improve our first approach while including dynamic obstacles as extra parameters.

APA, Harvard, Vancouver, ISO, and other styles

18

Shirazi, Ehsan, and Mohammad Zolghadr. "An Item Retrieval Algorithm in Flexible High-Density Puzzle Storage Systems." Applied System Innovation 4, no. 2 (2021): 38. http://dx.doi.org/10.3390/asi4020038.

Full text

Abstract:

This paper studies a design of a puzzle-based storage system. We developed an item retrieval algorithm for our system which has three advantages over the previous counterparts in the literature: (i) we can retrieve items from all sides of our storage system; (ii) the existence of only one empty cell in our system is sufficient to retrieve an item; and (iii) our algorithm never ends in deadlocks. The main feature of our algorithm is to prefer three moves to five moves in the process of moving the seized empty cell toward the optimal side of the requested item. The conventional view in the literature assumes that increasing the number of empty cells always reduces the number of movements required for retrieving items; however, our simulation results show that depending on the size of the puzzle and the number of the requested items, increasing empty cells might make the retrieval process more complicated.

APA, Harvard, Vancouver, ISO, and other styles

19

Meghzili, Said, Allaoua Chaoui, Raida Elmansouri, Bardis Nadjla Alloui, and Amina Bouabsa. "Formal Verification and Implementation of an E-Voting System." International Journal of Software Innovation 10, no. 1 (2022): 1–22. http://dx.doi.org/10.4018/ijsi.309731.

Full text

Abstract:

The organization of free, democratic, and transparent elections requires on the one hand an independent national electoral authority that manages all the stages of the electoral process and on the other hand the use of new information and communication techniques to manage the election process. E-voting offers the ability to vote online anytime and from anywhere using a computer, smartphone, or tablet. In addition, it saves time and reduces costs and effort spent in the process. However, the security of e-voting applications deployed on the internet is a difficult task due to the increasing number of cyber-attacks and application vulnerabilities. On the other hand, blockchain technology is an emerging technology with a strong cryptographic foundation. In this paper, the authors propose a new secure e-voting system based on Ethereum blockchain. In addition, they propose a hierarchical coloured petri net (HCPN) model for their e-voting system using CPN Tools. They verify by means of simulation techniques and state space analysis important properties such as absence of deadlocks and livelocks.

APA, Harvard, Vancouver, ISO, and other styles

20

Sgorbissa, Antonio. "Integrated robot planning, path following, and obstacle avoidance in two and three dimensions: Wheeled robots, underwater vehicles, and multicopters." International Journal of Robotics Research 38, no. 7 (2019): 853–76. http://dx.doi.org/10.1177/0278364919846910.

Full text

Abstract:

We propose an innovative, integrated solution to path planning, path following, and obstacle avoidance that is suitable both for 2D and 3D navigation. The proposed method takes as input a generic curve connecting a start and a goal position, and is able to find a corresponding path from start to goal in a maze-like environment even in the absence of global information, it guarantees convergence to the path with kinematic control, and finally avoids locally sensed obstacles without becoming trapped in deadlocks. This is achieved by computing a closed-form expression in which the control variables are a continuous function of the input curve, the robot’s state, and the distance of all the locally sensed obstacles. Specifically, we introduce a novel formalism for describing the path in two and three dimensions, as well as a computationally efficient method for path deformation (based only on local sensor readings) that is able to find a path to the goal even when such path cannot be produced through continuous deformations of the original. The article provides formal proofs of all the properties above, as well as simulated results in a simulated environment with a wheeled robot, an underwater vehicle, and a multicopter.

APA, Harvard, Vancouver, ISO, and other styles

21

Weerakoon, Tharindu, Kazuo Ishii, and Amir Ali Forough Nassiraei. "An Artificial Potential Field Based Mobile Robot Navigation Method To Prevent From Deadlock." Journal of Artificial Intelligence and Soft Computing Research 5, no. 3 (2015): 189–203. http://dx.doi.org/10.1515/jaiscr-2015-0028.

Full text

Abstract:

Abstract Artificial Potential Filed (APF) is the most well-known method that is used in mobile robot path planning, however, the shortcoming is that the local minima. To overcome this issue, we present a deadlock free APF based path planning algorithm for mobile robot navigation. The Proposed-APF (P-APF) algorithm searches the goal point in unknown 2D environments. This method is capable of escaping from deadlock and non-reachability problems of mobile robot navigation. In this method, the effective front-face obstacle information associated with the velocity direction is used to modify the Traditional APF (T-APF) algorithm. This modification solves the deadlock problem that the T-APF algorithm often converges to local minima. The proposed algorithm is explained in details and to show the effectiveness of the proposed approach, the simulation experiments were carried out in the MATLAB environment. Furthermore, the numerical analysis of the proposed approach is given to prove a deadlock free motion of the mobile robot.

APA, Harvard, Vancouver, ISO, and other styles

22

Koen, Willie, and Peter Zilla. "DEFYING THE DEADLOCK IN ARTIFICIAL HEART RESEARCH." ASAIO Journal 43, no. 2 (1997): 20. http://dx.doi.org/10.1097/00002480-199703000-00072.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Brzezinski, J., J. M. Helary, M. Raynal, and M. Singhal. "Deadlock Models and a General Algorithm for Distributed Deadlock Detection." Journal of Parallel and Distributed Computing 31, no. 2 (1995): 112–25. http://dx.doi.org/10.1006/jpdc.1995.1150.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Brzezinski, Jerzy, Jean-Michel Helary, Michel Raynal, and Mukesh Singhal. "Deadlock Models and a General Algorithm for Distributed Deadlock Detection." Journal of Parallel and Distributed Computing 32, no. 2 (1996): 232. http://dx.doi.org/10.1006/jpdc.1996.0017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Wang, Hao, Lian Yu Zhao, and Wei Chen. "A Mobile Robot Obstacle Avoidance Method Based on Improved Potential Field Method." Applied Mechanics and Materials 467 (December 2013): 496–501. http://dx.doi.org/10.4028/www.scientific.net/amm.467.496.

Full text

Abstract:

Proposing an obstacle avoidance method for mobile robot under unknown environment, which makes use of multiple ultrasonic sensors coordinating with each other and collects position information of obstacles followed by information fuzzy processing, applies artificial potential field method with improved potential function to project the travel path of the robot. It has solved the "deadlock" problem of the traditional artificial potential field method and achieved obstacle avoidance of mobile robot under unknown environment. By simulation analysis, robot obstacle avoidance can be implemented flexibly using this method.

APA, Harvard, Vancouver, ISO, and other styles

26

Lehur, Paul-Antoine, Dimitri Christoforidis, and Guillaume Meurette. "Artificial Sphincters to Treat Severe Fecal Incontinence: Currently in a Deadlock." Diseases of the Colon & Rectum 63, no. 8 (2020): 1017–19. http://dx.doi.org/10.1097/dcr.0000000000001708.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Aceto, L., and M. Hennessy. "Termination, deadlock, and divergence." Journal of the ACM 39, no. 1 (1992): 147–87. http://dx.doi.org/10.1145/147508.147527.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Alonso-Mora, Javier, Jonathan A. DeCastro, Vasumathi Raman, Daniela Rus, and Hadas Kress-Gazit. "Reactive mission and motion planning with deadlock resolution avoiding dynamic obstacles." Autonomous Robots 42, no. 4 (2017): 801–24. http://dx.doi.org/10.1007/s10514-017-9665-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Isihara, Hidenori, Toshio Fukuda, and Naohiro Hiraoka. "Deadlock resolution using hand-to-hand motion." Artificial Life and Robotics 1, no. 4 (1997): 197–203. http://dx.doi.org/10.1007/bf02471140.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Zhou, Yuebin, and Jianlong Xu. "IoT perception layer scheduling deadlock relieving optimization method." Journal of Intelligent & Fuzzy Systems 38, no. 6 (2020): 7521–29. http://dx.doi.org/10.3233/jifs-179824.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

YANG, STEPHEN J. H., and CHYUN-CHYI CHEN. "A PETRI-NETS-BASED APPROACH FOR WORKFLOW AND PROCESS AUTOMATION." International Journal on Artificial Intelligence Tools 08, no. 02 (1999): 193–205. http://dx.doi.org/10.1142/s0218213099000130.

Full text

Abstract:

Based on the workflow management coalition (WFMC) standard and component software technologies, this paper addresses our Petri-nets-based approach for workflow and process automation. Petri nets provide graphical and mathematical formalisms for work-flow process definition and analysis. In this paper, we will present how to use Petri nets and a toolkit NCUPN (National Central University Petri Nets toolkit) for process definition and analysis. NCUPN is a Petri nets modeling and analysis toolkit developed to help software engineers in drawing and doing analysis. Once a workflow process is drawn using NCUPN, analysis can be done automatically. In this paper, we will demonstrate how to use NCUPN to analyze behavioral properties of workflow process, such as deadlock, liveness, safety, and starvation.

APA, Harvard, Vancouver, ISO, and other styles

32

Nohara, Ben T., and Hiroko Takahashi. "Non-network Type Artificial Immune System and its Application to Automated Guided Vehicle (AGV) System." Journal of Advanced Computational Intelligence and Intelligent Informatics 4, no. 1 (2000): 111–19. http://dx.doi.org/10.20965/jaciii.2000.p0111.

Full text

Abstract:

This paper describes Artificial Immune-Based Control System that is applied to the automatic transportation control system of AGV (Automated Guided Vehicle) operated in a restricted area such as a container terminal and an ironworks. The authors propose the non-network type artificial immune system that is functioning in a unit level of antibodies instead of in a network of antigens and antibodies. AGVs equipped by the proposed method can avoid the collision and/or the deadlock and move autonomously from the source points to the destinations. The transportation system using AGVs has been expected because AGVs have the flexibility and efficiency. However the control system for AGVs is so flexible that the design has a big margin. Especially, the design for the control system is a hard work when the number of AGV becomes to be large. Only a few study of this problem is found in a past references. This paper focuses on the automatic transportation plan of AGVs in a real time scheduling using the non-network type artificial immune system. The comparison of the proposed method: the non-network type artificial immune system and the network type artificial immune system are also discussed and the computer simulation verifies the effectiveness of the proposed method.

APA, Harvard, Vancouver, ISO, and other styles

33

Compton, Kevin J., and Chinya Ravishankar. "Expected deadlock time in a multiprocessing system." Journal of the ACM 42, no. 3 (1995): 562–83. http://dx.doi.org/10.1145/210346.210412.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Datta, Ajoy K., Sukumar Ghosh, and Chou Tair-Shian. "A new algorithm for deadlock avoidance." Information Sciences 46, no. 1-2 (1988): 47–72. http://dx.doi.org/10.1016/0020-0255(88)90018-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Feitelson, Dror G. "Deadlock detection without wait-for graphs." Parallel Computing 17, no. 12 (1991): 1377–83. http://dx.doi.org/10.1016/s0167-8191(05)80004-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Kojima, Shotaro, Kazunori Ohno, Takahiro Suzuki, Yoshito Okada, Thomas Westfechtel, and Satoshi Tadokoro. "Wall Deadlock Evasion Control Based on Rotation Radius Adjustment." IEEE Robotics and Automation Letters 5, no. 2 (2020): 1358–65. http://dx.doi.org/10.1109/lra.2020.2967332.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Bertolazzi, P., and G. Bongiovanni. "A VLSI structure for the deadlock avoidance problem." Journal of Parallel and Distributed Computing 2, no. 4 (1985): 352–61. http://dx.doi.org/10.1016/0743-7315(85)90019-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Kshemkalyani, A. D., and M. Singhal. "On Characterization and Correctness of Distributed Deadlock Detection." Journal of Parallel and Distributed Computing 22, no. 1 (1994): 44–59. http://dx.doi.org/10.1006/jpdc.1994.1069.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Choi, Yungho, and Timothy Mark Pinkston. "Evaluation of Crossbar Architectures for Deadlock Recovery Routers." Journal of Parallel and Distributed Computing 61, no. 1 (2001): 49–78. http://dx.doi.org/10.1006/jpdc.2000.1669.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Zambonelli, Franco, and Robert H. B. Netzer. "Deadlock-Free Incremental Replay of Message-Passing Programs." Journal of Parallel and Distributed Computing 61, no. 5 (2001): 667–78. http://dx.doi.org/10.1006/jpdc.2001.1703.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Mohammed, Thabit Sultan. "Performance Improvement and Deadlock Prevention for a Distributed Fault Diagnosis Algorithm." Journal of Computer Science 3, no. 2 (2007): 107–12. http://dx.doi.org/10.3844/jcssp.2007.107.112.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Stewart, Charles, and Barry R. Weingast. "Stacking the Senate, Changing the Nation: Republican Rotten Boroughs, Statehood Politics, and American Political Development." Studies in American Political Development 6, no. 2 (1992): 223–71. http://dx.doi.org/10.1017/s0898588x00000985.

Full text

Abstract:

Info the 1870s, Republican Leaders were preoccupied with the danger that a Southern re-entry into the political system might produce an overthrow of their coalition at the polls and a restoration of the Jacksonian coalition to its former dominance. Nor was this a chimera: the success of the Republican revolution in national policy-making had been predicated upon enormous artificial majorities that were produced in a Congress in which the Southern states were not represented. Indeed, the Republican fears were partially realized after 1872. Southern “Redemption” and the persistence of traditional Northern support for the Democrats resulted in a unique period of partisan deadlock which lasted from 1874 until Republican capture of all branches of the federal government in 1896.

APA, Harvard, Vancouver, ISO, and other styles

43

Chen, Runfeng, Jie Li, Yiting Chen, and Yuchong Huang. "A Distributed Double-Loop Optimization Method with Fast Response for UAV Swarm Scheduling." Drones 7, no. 3 (2023): 216. http://dx.doi.org/10.3390/drones7030216.

Full text

Abstract:

An unmanned aerial vehicle (UAV) swarm has broad application prospects, in which scheduling is one of the key technologies determining the completion of tasks. A market-based approach is an effective way to schedule UAVs distributively and quickly, meeting the real-time requirements of swarm scheduling without a centre. In this paper, a double-loop framework is designed to enhance the performance of scheduling, where a new task removal method in the outer loop and a local redundant auction method in the inner loop are proposed to improve the optimization of scheduling and reduce iterations. Furthermore, a deadlock detection mechanism is introduced to avoid endless loops and the scheduling with the lowest local cost will be adopted to exit the cycle. Extensive Monte Carlo experiments show that the iterations required by the proposed method are less than the two representative algorithms consensus-based bundle algorithm (CBBA) and performance impact (PI) algorithm, and the number of allocated tasks is increased. In addition, through the deadlock avoidance mechanism, PI can completely converge as the method in this paper.

APA, Harvard, Vancouver, ISO, and other styles

44

Nursanty, Ida Ayu, Endang Kartini, and I. Made Murjana. "Spiritualitas Dalam Akuntansi Sang Pembebas Dari Kuasa Kapitalisme." Jurnal Akuntansi dan Ekonomika 11, no. 1 (2021): 109–18. http://dx.doi.org/10.37859/jae.v11i1.2549.

Full text

Abstract:

The objectives of the research are to criticize the modern accounting is entrenched under the auspices of capitalism, especially accounting in Indonesia, and to an alternative idea for a better one. Is done as there as a strength that accounting for capitalism has reached a deadlock in answering current problems. Conventional accounting as a product of the modern era which has the spirit of capitalism is always oriented towards maximizing profit and rationality of recording. The impact of this understanding makes accounting a means of legitimating certain parties to seek maximum profit, without paying attention to other artificial interests. Through a rasionalis spiritualist approach, the research suggests the internalization of "spirituality" which refers to Islamic spirituality. Under the internalization of Islamic spirituality, accounting can be separated from the domination of capitalism.

APA, Harvard, Vancouver, ISO, and other styles

45

Shirvani, Abdolreza, and B. John Oommen. "On enhancing the deadlock-preventing object migration automaton using the pursuit paradigm." Pattern Analysis and Applications 23, no. 2 (2019): 509–26. http://dx.doi.org/10.1007/s10044-019-00817-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Bi, Jing, Haitao Yuan, and Wei Tan. "Deadlock prevention for service orchestration via controlled Petri nets." Journal of Parallel and Distributed Computing 124 (February 2019): 92–105. http://dx.doi.org/10.1016/j.jpdc.2018.09.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Li, Qiang. "Minimum deadlock-free message routing restrictions in binary hypercubes." Journal of Parallel and Distributed Computing 15, no. 2 (1992): 153–59. http://dx.doi.org/10.1016/0743-7315(92)90107-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Lu, Faming, Ranran Tao, Yuyue Du, Qingtian Zeng, and Yunxia Bao. "Deadlock detection-oriented unfolding of unbounded Petri nets." Information Sciences 497 (September 2019): 1–22. http://dx.doi.org/10.1016/j.ins.2019.05.021.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Trisanto, Dedy, and Muhamad Agus. "Optimasi Sistem Informasi Penjadwalan Kuliah Berbasis Heuristic Search yang Dikombinasikan dengan Teknik Smart Back Tracking dan Look Ahead (Studi Kasus pada STMI –Kementerian Perindustrian)." Jurnal Teknik Mesin 9, no. 1 (2012): 53–60. http://dx.doi.org/10.30630/jtm.9.1.23.

Full text

Abstract:

Scheduling lecture is scheduled number of components consisting of courses, lecturer, students, classrooms, and time with a number of restrictions and requirements (constraints) certain to get optimal results and the best. In this paper will be discussed and created scheduling lecture with a problem-solving approach to the science of Artificial Intelligence (Artificial Intelligence), by using an approximation of the mathematical problem that is aiming to find a situation or object that meets a number of requirements or specific criteria (Constraint Satisfaction Problem) to get the optimal scheduling and the best. To solve these problems the solution search techniques used by an algorithm that will result in optimal scheduling and the best (heuristic search) techniques combined with Smart Backtracking and Look Ahead called Intelligent Search to find and resolve problems when encountered a condition where no there is a solution in due course scheduling constraints and requirements are not met (deadlock). The application of these methods and techniques in the course scheduling information system is built, using the PHP programming language and MySQL database to solve the problem of scheduling to get optimal results and the best.

APA, Harvard, Vancouver, ISO, and other styles

50

Luo, Jianchao, Zhiqiang Liu, Shuogang Wang, and Keyi Xing. "Robust deadlock avoidance policy for automated manufacturing system with multiple unreliable resources." IEEE/CAA Journal of Automatica Sinica 7, no. 3 (2020): 812–21. http://dx.doi.org/10.1109/jas.2020.1003096.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!