To see the other types of publications on this topic, follow the link: Deadlock prevention.

Journal articles on the topic 'Deadlock prevention'

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 'Deadlock prevention.'

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

Huang, Yi Sheng, and Ter Chan Row. "A Channelized Deadlock Prevention Policy for Flexible Manufacturing Systems Using Petri Net Models." Advanced Materials Research 284-286 (July 2011): 1498–501. http://dx.doi.org/10.4028/www.scientific.net/amr.284-286.1498.

Full text
Abstract:
Deadlock prevention, deadlock detection and deadlock avoidance strategies are used to solve the deadlock problems of flexible manufacturing systems (FMSs). The conventional prevention policies were always attempt to prevent the system entering the deadlocked situation by using a few control places. On can know that one prohibits the deadlocked markings, some dead markings will be sacrificed. Therefore, the reachability states will become less than the initial net. However, our goal is to preserve all the reachability states of the initial net. Under our control policy, the deadlocks or deadloc
APA, Harvard, Vancouver, ISO, and other styles
2

Kezić, Danko, Stjepan Bogdan, and Josip Kasum. "Design of Deadlock Prevention Supervisor in Waterway with Multiple Locks and Canals." Transactions on Maritime Science 1, no. 1 (2012): 22–34. http://dx.doi.org/10.7225/toms.v01.n01.004.

Full text
Abstract:
To avoid conflict and deadlock states in waterway with multiple locks and canals, a computer based traffic management system with proper control policy must be applied. The paper proposes a formal method for design of deadlock prevention supervisor by using discrete event theory, multiple reentrant flowlines class of Petri net and P-invariants control places calculation. By using and/or matrix algebra, authors analyze the structural characteristics of Petri net in order to find first and second level deadlocks. First level deadlocks are prevented by maintaining the number of vessels in the cri
APA, Harvard, Vancouver, ISO, and other styles
3

Kim, Chang Wan, J. M. A. Tanchoco, and Pyung-Hoi Koo. "Deadlock Prevention in Manufacturing Systems With AGV Systems: Banker’s Algorithm Approach." Journal of Manufacturing Science and Engineering 119, no. 4B (1997): 849–54. http://dx.doi.org/10.1115/1.2836834.

Full text
Abstract:
An important issue in the operational control of an automated job shop is the prevention and resolution of shop deadlocks. In this paper, we discuss the problems and solutions of deadlocks in manufacturing systems with automated guided vehicle systems, describe a banker’s algorithm for the control of material flow in job shops, and present the results of simulation experiments to compare the performance of several deadlock handling methods.
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Zhi Wu, and Abdulrahman M. Al-Ahmari. "Open Problems in Deadlock Control for Flexible Manufacturing Systems by Using Petri Nets." Applied Mechanics and Materials 88-89 (August 2011): 134–41. http://dx.doi.org/10.4028/www.scientific.net/amm.88-89.134.

Full text
Abstract:
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. This work surveys the open problems in deadlock control for automated manufacturing systems. The focus is deadlock prevention due to its large and continuing stream of efforts. A control strategy is evaluated in terms of computational complexity, behavioral permissiveness, and structural complexity of its deadlock-free supervisor. This study provides readers with a cong
APA, Harvard, Vancouver, ISO, and other styles
5

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 th
APA, Harvard, Vancouver, ISO, and other styles
6

Pan, Yen-Liang, Yi-Sheng Huang, Yi-Shun Weng, Weimin Wu, and MuDer Jeng. "Computationally Improved Optimal Control Methodology for Linear Programming Problems of Flexible Manufacturing Systems." Journal of Applied Mathematics 2013 (2013): 1–11. http://dx.doi.org/10.1155/2013/294835.

Full text
Abstract:
Deadlock prevention policies are used to solve the deadlock problems of FMSs. It is well known that the theory of regions is the efficient method for obtaining optimal (i.e., maximally permissive) controllers. All legal and live maximal behaviors of Petri net models can be preserved by using marking/transition-separation instances (MTSIs) or event-state-separation-problem (ESSP) methods. However, they encountered great difficulties in solving all sets of inequalities that is an extremely time consuming problem. Moreover, the number of linear programming problems (LPPs) of legal markings is als
APA, Harvard, Vancouver, ISO, and other styles
7

Pan, Yen-Liang, Ching-Yun Tseng, and Ter-Chan Row. "Design of improved optimal and suboptimal deadlock prevention for flexible manufacturing systems based on place invariant and reachability graph analysis methods." Journal of Algorithms & Computational Technology 11, no. 3 (2017): 261–70. http://dx.doi.org/10.1177/1748301817710922.

Full text
Abstract:
Flexible manufacturing systems exhibit a high degree of resource sharing. Since the parts advancing through the system compete for a finite number of resources, a deadlock may occur. Accordingly, many pioneers make efforts in the issue. However, how to obtain maximally permissive supervisors in deadlock flexible manufacturing system is an extremely difficult and time-consuming problem. In existing literature, place invariant) and graph analysis method are merged called maximal number of forbidding First Bad Marking (FBM) problem to obtained optimal controllers with a small number of control pl
APA, Harvard, Vancouver, ISO, and other styles
8

Kaid, Husam, Abdulrahman Al-Ahmari, Zhiwu Li, and Reggie Davidrajuh. "Automatic Supervisory Controller for Deadlock Control in Reconfigurable Manufacturing Systems with Dynamic Changes." Applied Sciences 10, no. 15 (2020): 5270. http://dx.doi.org/10.3390/app10155270.

Full text
Abstract:
In reconfigurable manufacturing systems (RMSs), the architecture of a system can be modified during its operation. This reconfiguration can be caused by many motivations: processing rework and failures, adding new products, adding new machines, etc. In RMSs, sharing of resources may lead to deadlocks, and some operations can therefore remain incomplete. The objective of this article is to develop a novel two-step solution for quick and accurate reconfiguration of supervisory controllers for deadlock control in RMSs with dynamic changes. In the first step, the net rewriting system (NRS) is used
APA, Harvard, Vancouver, ISO, and other styles
9

Huang, Yi Sheng, and Ter Chan Row. "Petri Net Channelized-Based Deadlock Prevention Policy for Flexible Manufacturing Systems." Advanced Materials Research 317-319 (August 2011): 552–55. http://dx.doi.org/10.4028/www.scientific.net/amr.317-319.552.

Full text
Abstract:
Petri nets are employed to model flexible manufacturing systems (FMSs). However, the system deadlocked are possible happened. The conventional deadlock prevention policies are always to forbid the system entering the deadlock by using the control places. To obtain a live system, some dead markings must be sacrificed in the traditional policies. Therefore, the original reachability states of the original model can not be conserved. However, this paper is able to maintain all the reachability states of the original net and guaranty the control system live. Under our control policy, all number of
APA, Harvard, Vancouver, ISO, and other styles
10

Abouel Nasr, Emad, Abdulaziz M. El-Tamimi, Abdulrahman Al-Ahmari, and Husam Kaid. "Comparison and Evaluation of Deadlock Prevention Methods for Different Size Automated Manufacturing Systems." Mathematical Problems in Engineering 2015 (2015): 1–19. http://dx.doi.org/10.1155/2015/537893.

Full text
Abstract:
In automated manufacturing systems (AMSs), deadlocks problems can arise due to limited shared resources. Petri nets are an effective tool to prevent deadlocks in AMSs. In this paper, a simulation based on existing deadlock prevention policies and different Petri net models are considered to explore whether a permissive liveness-enforcing Petri net supervisor can provide better time performance. The work of simulation is implemented as follows. (1) Assign the time to the controlled Petri net models, which leads to timed Petri nets. (2) Build the Petri net model using MATLAB software. (3) Run an
APA, Harvard, Vancouver, ISO, and other styles
11

DI IANNI, MIRIAM. "WORMHOLE DEADLOCK PREDICTION." Parallel Processing Letters 10, no. 04 (2000): 295–303. http://dx.doi.org/10.1142/s0129626400000287.

Full text
Abstract:
Deadlock prevention is usually realized by forbidding transmissions that could eventually cause a deadlock to occur. However, an optimal routing algorithm with respect to channel utilization forbids transmissions only when they would bring the network into a configuration that will necessarily evolve into a deadlock. Hence, optimal deadlock prevention is closely related to deadlock prediction. In this paper it is shown that wormhole deadlock and livelock prediction is a hard problem for both oblivious and adaptive routing.
APA, Harvard, Vancouver, ISO, and other styles
12

Liu, Miao, Shouguang Wang, and Zhiwu Li. "Supervisor Reconfiguration for Deadlock Prevention by Resources Reallocation." Journal of Applied Mathematics 2013 (2013): 1–11. http://dx.doi.org/10.1155/2013/315894.

Full text
Abstract:
Analysis and control of deadlocks play an important role in the design and operation of automated flexible manufacturing systems (FMSs). In FMS, deadlocks are highly undesirable situations, which always cause unnecessary cost. The design problem of an optimal supervisor is in general NP-hard. A computationally efficient method often ends up with a suboptimal one. This paper develops a deadlock prevention policy based on resources reallocation and supervisor reconfiguration. First, given a plant model, we reallocate the marking of each resource place to be one, obtaining a net model whose reach
APA, Harvard, Vancouver, ISO, and other styles
13

Bermond, Jean-Claude, Miriam Di Ianni, Michele Flammini, and Stéphane Pérennès. "Deadlock prevention by acyclic orientations." Discrete Applied Mathematics 129, no. 1 (2003): 31–47. http://dx.doi.org/10.1016/s0166-218x(02)00232-9.

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

Oliveira, Fabiano de S., and Valmir C. Barbosa. "Revisiting deadlock prevention: A probabilistic approach." Networks 63, no. 2 (2013): 203–10. http://dx.doi.org/10.1002/net.21537.

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

Malhotra, Deepti. "Deadlock Prevention Algorithm in Grid Environment." MATEC Web of Conferences 57 (2016): 02013. http://dx.doi.org/10.1051/matecconf/20165702013.

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

Xu, Gang, and Zhiming Wu. "Deadlock prevention for flexible manufacturing system." Journal of Control Theory and Applications 3, no. 4 (2005): 377–82. http://dx.doi.org/10.1007/s11768-005-0027-0.

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

Shang, Kun, and Kai Zhang. "The Analysis and Avoidance of Concurrent Processes Deadlock." Advanced Materials Research 219-220 (March 2011): 45–48. http://dx.doi.org/10.4028/www.scientific.net/amr.219-220.45.

Full text
Abstract:
Deadlock is a common problem in concurrent processing where two or more processes compete for resources in mutually exclusive way to access critical resources. The in-depth analysis and discussion about deadlock would be conducive to the improvement of reliability of the operating system. In this paper, problems about deadlock is analyzed and overviewed, including concept, cause of the deadlock, and prevention, avoidance , detection, and recovery from deadlock, etc .
APA, Harvard, Vancouver, ISO, and other styles
18

Row, Ter-Chan, and Yen-Liang Pan. "Maximally permissive deadlock prevention policies for flexible manufacturing systems using control transition." Advances in Mechanical Engineering 10, no. 7 (2018): 168781401878740. http://dx.doi.org/10.1177/1687814018787406.

Full text
Abstract:
Nowadays, many kinds of flexible manufacturing systems are used to process many complex manufacturing works due to their machine flexibility and routing flexibility. However, such competition (i.e. robots and machines) for shared resources by concurrent job processes can lead to the problem of a system deadlock. In existing researches, almost experts adopted place-based as controllers to solve the deadlock problems of flexible manufacturing systems whatever the concept of siphons or the reachability graph method are used. Among them, only the reachability graph ones can obtain maximally permis
APA, Harvard, Vancouver, ISO, and other styles
19

Viswanadham, N., Y. Narahari, and T. L. Johnson. "Deadlock prevention and deadlock avoidance in flexible manufacturing systems using Petri net models." IEEE Transactions on Robotics and Automation 6, no. 6 (1990): 713–23. http://dx.doi.org/10.1109/70.63257.

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

Abdoos, Mahboobeh. "Improved Deadlock Prevention Algorithms in Distributed Systems." International Journal of Engineering and Applied Computer Science 02, no. 02 (2017): 75–78. http://dx.doi.org/10.24032/ijeacs/0202/05.

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

Tsutsui, S. "Deadlock Prevention in Process Control Computer Systems." Computer Journal 30, no. 1 (1987): 20–26. http://dx.doi.org/10.1093/comjnl/30.1.20.

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

Reddy, P. Krishna, and Subhash Bhalla. "Deadlock prevention in a distributed database system." ACM SIGMOD Record 22, no. 3 (1993): 40–46. http://dx.doi.org/10.1145/163090.163097.

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

Davidson, Susan, Insup Lee, and Victor Fay Wolfe. "Deadlock prevention in concurrent real-time systems." Real-Time Systems 5, no. 4 (1993): 305–18. http://dx.doi.org/10.1007/bf01088833.

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

WU, Wen-Hui, and Shou-Guang WANG. "A Deadlock Prevention Policy Based on Complementary Places." Chinese Journal of Computers 36, no. 11 (2014): 2257–65. http://dx.doi.org/10.3724/sp.j.1016.2013.02257.

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

Roux, O. H., and P. Martineau. "Deadlock Prevention in a Distributed Real-Time System." IFAC Proceedings Volumes 28, no. 22 (1995): 123–28. http://dx.doi.org/10.1016/s1474-6670(17)46680-8.

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

Awerbuch, B., S. Kutten, and D. Peleg. "On buffer-economical store-and-forward deadlock prevention." IEEE Transactions on Communications 42, no. 11 (1994): 2934–37. http://dx.doi.org/10.1109/26.328973.

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

Guo, Xin, Shouguang Wang, Dan You, Zhifu Li, and Xiaoning Jiang. "A Siphon-Based Deadlock Prevention Strategy for S3PR." IEEE Access 7 (2019): 86863–73. http://dx.doi.org/10.1109/access.2019.2920677.

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

Iordache, M. V., J. Moody, and P. J. Antsaklis. "Synthesis of deadlock prevention supervisors using Petri nets." IEEE Transactions on Robotics and Automation 18, no. 1 (2002): 59–68. http://dx.doi.org/10.1109/70.988975.

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

Corradi, Antonio, and Cesare Stefanelli. "A deadlock prevention strategy for adaptive routing systems." Microprocessors and Microsystems 20, no. 2 (1996): 97–103. http://dx.doi.org/10.1016/0141-9331(95)01077-7.

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

Huang, Yi-Sheng. "Design of deadlock prevention supervisors using Petri nets." International Journal of Advanced Manufacturing Technology 35, no. 3-4 (2006): 349–62. http://dx.doi.org/10.1007/s00170-006-0708-y.

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

Taubin, A., A. Kondratyev, and M. Kishinevsky. "Deadlock prevention using Petri nets and their unfoldings." International Journal of Advanced Manufacturing Technology 14, no. 10 (1998): 750–59. http://dx.doi.org/10.1007/bf01438227.

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

Pan, Yen-Liang, Cheng-Fu Yang, and Mu-Der Jeng. "Enhancement of Selective Siphon Control Method for Deadlock Prevention in FMSs." Mathematical Problems in Engineering 2015 (2015): 1–6. http://dx.doi.org/10.1155/2015/196514.

Full text
Abstract:
One novel control policy named selective siphon control policy is proposed to solve for deadlock problems of flexible manufacturing systems (FMSs). The new policy not only solves the deadlock problem successfully but also obtains maximally permissive controllers. According to our awareness, the policy is the first one to achieve the goal of obtaining maximally permissive controllers for all S3PR (one system of simple sequential processes with resources, S3PR) models in existing literature. However, one main problem is still needed to solve in their algorithm. The problem is that the proposed p
APA, Harvard, Vancouver, ISO, and other styles
33

Pan, Yen Liang, and Yi Sheng Huang. "Solutions for Deadlocked Problem of FMSs Using Theory of Regions." Advanced Materials Research 314-316 (August 2011): 535–38. http://dx.doi.org/10.4028/www.scientific.net/amr.314-316.535.

Full text
Abstract:
Deadlock prevention problem is an important issue in essence for flexible manufacturing systems (FMS). Many works make efforts in the issue. Theory of regions is recognized as one of the powerful deadlock prevention method for obtaining maximally permissive controllers. All legal and live maximal behavior of Petri net models can be preserved by using marking/transition-separation instance (MTSI) or event-state-separation-problem (ESSP) methods. However, solving all sets of inequalities are an extremely time consuming problem since all MTSIs and ESSPs need to be considered in the reachability g
APA, Harvard, Vancouver, ISO, and other styles
34

Xie, Xiaolan, YiSheng Huang, MuDer Jeng, and ShengLuen Chung. "An Iterative Deadlock Prevention Policy Based on Petri net." IFAC Proceedings Volumes 33, no. 17 (2000): 1007–12. http://dx.doi.org/10.1016/s1474-6670(17)39542-3.

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

Hu, Wensong, Yuyuan Zhu, and Jie Lei. "The Detection and Prevention of Deadlock in Petri Nets." Physics Procedia 22 (2011): 656–59. http://dx.doi.org/10.1016/j.phpro.2011.11.102.

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

Waring, L. C. "Deadlock prevention in a communications shell using empty slots." Microprocessing and Microprogramming 33, no. 1 (1991): 33–43. http://dx.doi.org/10.1016/0165-6074(91)90013-j.

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

Gopal, I. "Prevention of Store-and-Forward Deadlock in Computer Networks." IEEE Transactions on Communications 33, no. 12 (1985): 1258–64. http://dx.doi.org/10.1109/tcom.1985.1096253.

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

Blazewicz, J., J. Brzezinski, and G. Gambosi. "Time-Stamp Approach to Store-and-Forward Deadlock Prevention." IEEE Transactions on Communications 35, no. 5 (1987): 490–95. http://dx.doi.org/10.1109/tcom.1987.1096799.

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

Hu, H. S. "An iterative deadlock prevention approach for automated manufacturing systems." Transactions of the Institute of Measurement and Control 33, no. 1 (2009): 59–76. http://dx.doi.org/10.1177/0142331208095620.

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

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
41

Zhuang, Qiaoli, Wenzhan Dai, Shouguang Wang, and Fan Ning. "Deadlock Prevention Policy for S4PR Nets Based on Siphon." IEEE Access 6 (2018): 50648–58. http://dx.doi.org/10.1109/access.2018.2868981.

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

Huang, Yisheng, Muder Jeng, Xiaolan Xie, and Shengluen Chung. "Deadlock prevention policy based on Petri nets and siphons." International Journal of Production Research 39, no. 2 (2001): 283–305. http://dx.doi.org/10.1080/00207540010002405.

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

Huang, Yi-Sheng, Ter-Chan Row, and Weimin Wu. "Deadlock prevention technique using additional transitions for Petri nets." Journal of the Chinese Institute of Engineers 41, no. 6 (2018): 483–93. http://dx.doi.org/10.1080/02533839.2018.1498019.

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

Huang, Y. S., M. Jeng, X. Xie, and D. H. Chung. "Siphon-Based Deadlock Prevention Policy for Flexible Manufacturing Systems." IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans 36, no. 6 (2006): 1248–56. http://dx.doi.org/10.1109/tsmca.2006.878953.

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

Luigi Piroddi, R. Cordone, and I. Fumagalli. "Selective Siphon Control for Deadlock Prevention in Petri Nets." IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans 38, no. 6 (2008): 1337–48. http://dx.doi.org/10.1109/tsmca.2008.2003535.

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

Hu, Shuihai, Yibo Zhu, Peng Cheng, et al. "Tagger: Practical PFC Deadlock Prevention in Data Center Networks." IEEE/ACM Transactions on Networking 27, no. 2 (2019): 889–902. http://dx.doi.org/10.1109/tnet.2019.2902875.

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

Liu, Gaiyun, Daniel Yuh Chao, and Murat Uzam. "Maximally permissive deadlock prevention via an invariant controlled method." International Journal of Production Research 51, no. 15 (2013): 4431–42. http://dx.doi.org/10.1080/00207543.2012.752590.

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

Zhuang, Qiaoli, Wenzhan Dai, Shouguang Wang, Jingjing Du, and Qiuhong Tian. "An MIP-Based Deadlock Prevention Policy for Siphon Control." IEEE Access 7 (2019): 153782–90. http://dx.doi.org/10.1109/access.2019.2939855.

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

Piroddi, Luigi, Michele Cossalter, and Luca Ferrarini. "A resource decoupling approach for deadlock prevention in FMS." International Journal of Advanced Manufacturing Technology 40, no. 1-2 (2007): 157–70. http://dx.doi.org/10.1007/s00170-007-1319-y.

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

Błażewicz, J., J. Brzeziński, and G. Gambosi. "Optimization aspects of deadlock prevention in packet-switching networks." European Journal of Operational Research 57, no. 1 (1992): 1–12. http://dx.doi.org/10.1016/0377-2217(92)90300-x.

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!