Relevant bibliographies by topics / Artificial Deadlocks

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Artificial Deadlocks"

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
More sources

Dissertations / Theses on the topic "Artificial Deadlocks"

1

Souza, Wesley Willy Oliveira de. "Método de resolução de deadlocks no controle de produção de sistemas de manufatura automatizados utilizando redes de Petri coloridas." Universidade Federal de São Carlos, 2011. https://repositorio.ufscar.br/handle/ufscar/521.

Full text
Abstract:
Made available in DSpace on 2016-06-02T19:06:03Z (GMT). No. of bitstreams: 1 4911.pdf: 4490259 bytes, checksum: 94cfbdb804ef2f55cb81e1163b1c6ad4 (MD5) Previous issue date: 2011-07-01<br>Universidade Federal de Sao Carlos<br>Resources sharing is one of the main characteristics of Automated Manufacturing Systems (SMA), this characteristic can be a synonym of advantages but on the other hand it may lead to the problem of deadlock. Several papers have suggested methods and techniques to reduce or eliminate the occurrence of deadlocks in SMA systems. The deadlock resolution strategies suggested in the literature can be classified into the following types: deadlock detection and recovery, deadlock prevention and deadlock avoidance. This work proposes a resolution method for the control of automated manufacturing systems using colored Petri nets, the main goal of the proposed method is to provide a deadlock-free production controller. To model, simulate and implement the technique in a production controller a dedicated software is used to model the Petri Nets. Initially, a model using Colored Petri Nets is proposed, then changes in the model are introduced in order to eliminate the deadlocks, resulting in a Colored Petri net control model of the SMA. Finally the model is implemented in the scenario of a Flexible Manufacturing System for testing and validation of the method.<br>O Compartilhamento de recursos é uma das principais características dos Sistemas de Manufatura Automatizados (SMA), esta característica pode ser um sinônimo de vantagens, mas por outro lado pode levar ao problema de deadlock. Diversos trabalhos têm sugerido métodos e técnicas para reduzir ou eliminar a ocorrência de deadlocks em SMA. As estratégias de resolução de deadlock sugerido na literatura podem ser classificados nos seguintes tipos: detecção e recuperação de deadlocks, prevenção de deadlocks e de deadlock. Este trabalho propõe um método de resolução para o controle de sistemas de manufatura automatizados utilizando redes de Petri coloridas, o principal objetivo do método proposto é obter um controlador da produção livre de deadlocks. Para modelar, simular e implementar a técnica em um controlador de produção um software dedicado é usado para modelar a rede de Petri. Inicialmente, um modelo usando Redes de Petri Coloridas é proposto, então mudanças são introduzidas, a fim de eliminar os deadlocks, resultando em um modelo de rede de Petri de um SMA livre de deadlock. Finalmente o modelo é implementado no cenário de um Sistema de Manufatura Flexível para testes e validação do método.
APA, Harvard, Vancouver, ISO, and other styles
2

Bharath, N. "Early Detection Of Artificial Deadlocks In Process Networks." Thesis, 2005. https://etd.iisc.ac.in/handle/2005/1398.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bharath, N. "Early Detection Of Artificial Deadlocks In Process Networks." Thesis, 2005. http://etd.iisc.ernet.in/handle/2005/1398.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Artificial Deadlocks"

1

Lorino, Philippe. Trans-action. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198753216.003.0005.

Full text
Abstract:
What makes action or meaning social or organizational? How is the social dimension maintained through changing situations? In trying to answer such questions, much of the organization literature oscillates between individualism and holism, or tries to relate two so-called “levels”—the “micro” level of local action and the “macro” level of social structures. The pragmatists reject such dualist deadlocks. They propose a view of sociality as an ongoing process rather than a state. Actors, far from being individuals engaging in socialization processes, are continuously constructing themselves in the very movement of addressing others. This chapter presents the static view of sociality as shared mental or artificial representations. In light of a few examples, it stresses the limits of sharedness approaches and presents the dialogical view of sociality developed by the pragmatist authors, leading to the theory of trans-action, a situated and mediated framework, referring to a relational ontology that fuses temporality and sociality.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Artificial Deadlocks"

1

Kujirai, Toshihiro, and Takayoshi Yokota. "Breaking Deadlocks in Multi-agent Reinforcement Learning with Sparse Interaction." In PRICAI 2019: Trends in Artificial Intelligence. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-29908-8_58.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Giebas, Damian, and Rafał Wojszczyk. "Rules in Detection of Deadlocks in Multithreaded Applications." In Distributed Computing and Artificial Intelligence, Special Sessions, 17th International Conference. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-53829-3_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ashfield, Bruce, Dwight Deugo, Franz Oppacher, and Tony White. "Distributed Deadlock Detection in Mobile Agent Systems." In Developments in Applied Artificial Intelligence. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-48035-8_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Junghanns, Andreas, and Jonathan Schaeffer. "Sokoban: Evaluating standard single-agent search techniques in the presence of deadlock." In Advances in Artificial Intelligence. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-64575-6_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rocha, Camilo, and José Meseguer. "Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories." In Logic for Programming, Artificial Intelligence, and Reasoning. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16242-8_42.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rennard, Jean-Philippe. "Perspectives for Strong Artificial Life." In Recent Developments in Biologically Inspired Computing. IGI Global, 2005. http://dx.doi.org/10.4018/978-1-59140-312-8.ch012.

Full text
Abstract:
This chapter introduces the twin deadlocks of strong artificial life. Conceptualization of life is a deadlock both because of the existence of a continuum between the inert and the living, and because we only know one instance of life. Computationalism is a second deadlock since it remains a matter of faith. Nevertheless, artificial life realizations quickly progress and recent constructions embed an always-growing set of the intuitive properties of life. This growing gap between theory and realizations should sooner or later crystallize in some kind of “paradigm shift” and then give clues to break the twin deadlocks.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Artificial Deadlocks"

1

Alexieva, Sonya. "COMMUNICATIONS IN TOURISM IN TIMES OF PANDEMIC: FROM CONVENTIONAL TO DIGITAL CONNECTIVITY." In TOURISM AND CONNECTIVITY 2020. University publishing house "Science and Economics", University of Economics - Varna, 2020. http://dx.doi.org/10.36997/tc2020.655.

Full text
Abstract:
Being one of the industries that have been the hardest hit by the coronavirus pandemic, tourism is actively using all communication channels, from conventional to digital connectivity in choosing messages. Trustworthy information is in the focus of finding an outcome from deadlock and stress in the context of gradual recovery of tourism services through adequate health and safety protocols. The synergy of conventional and digital communication in the COVID-19 era (digital technology and data, mobile applications, artificial intelligence etc.) effectively adapts the measures to a situation characterized by paralysis of business activity and restrictions on travel and tourism. This paper offers a brief analysis of key messages in the unprecedented situation caused by the COVID-19 pandemic, in the context of the blow dealt to European tourism.
APA, Harvard, Vancouver, ISO, and other styles
2

Chen, Yin, Xinjun Mao, and Fu Hou. "Deadlock Prevention in Rendezvous Generation for On-demand Inter-robot Resource Delivery." In 9th International Conference on Agents and Artificial Intelligence. SCITEPRESS - Science and Technology Publications, 2017. http://dx.doi.org/10.5220/0006225806700675.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wei, Xiong, and Meng Cheng. "DSPN: Deadlock Detection and Solutions of Reachability Graphs for Petri Nets." In 2021 3rd International Conference on Artificial Intelligence and Advanced Manufacture (AIAM). IEEE, 2021. http://dx.doi.org/10.1109/aiam54119.2021.00008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lu Yang, Wei Zhen, Xu Wei, and Fang Huan. "Deadlock prevention method for locomotive transportation dispatching system based on Petri Nets." In International Conference on Automatic Control and Artificial Intelligence (ACAI 2012). Institution of Engineering and Technology, 2012. http://dx.doi.org/10.1049/cp.2012.1086.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Feng, Rui, Peng Zhang, and Yuefan Deng. "Deadlock-Free Routing Algorithms for 6D Mesh/iBT Interconnection Networks." In 2013 14th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD). IEEE, 2013. http://dx.doi.org/10.1109/snpd.2013.43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mani, Nariman, Vahid Garousi, and Behrouz H. Far. "Runtime Monitoring of Multi-agent Manufacturing Systems for Deadlock Detection Based on Models." In 2009 21st IEEE International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2009. http://dx.doi.org/10.1109/ictai.2009.112.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hasanzade, Elmira, and Seyed Morteza Babamir. "An artificial neural network based model for online prediction of potential deadlock in multithread programs." In 2012 16th CSI International Symposium on Artificial Intelligence and Signal Processing (AISP). IEEE, 2012. http://dx.doi.org/10.1109/aisp.2012.6313784.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Passos, Ligia Maria Soares, and Stephane Julia. "Linear Logic as a Tool for Deadlock-Freeness Scenarios Detection in Interorganizational Workflow Processes." In 2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2014. http://dx.doi.org/10.1109/ictai.2014.55.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Artificial Deadlocks' for particular source types:
Journal articles
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!

To the bibliography