The theory of deadlock avoidance via discrete control

WangYin,; Lafortune, Stéphane; KellyTerence,; KudlurManjunath,; MahlkeScott,

doi:10.1145/1594834.1480913

Cited by 56 publications

(74 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Additional emerging application of supervisory control is deadlock avoidance in concurrency programming [34]. Concurrency bugs usually occur due to thread synchronization issues and are extremely hard to diagnose [35].…”

Section: Discussionmentioning

confidence: 99%

The role of supervisory controller synthesis in automatic control software development

Baeten

Markovski

2015

Science of Computer Programming

View full text Add to dashboard Cite

h i g h l i g h t s• We discuss the role of supervisor synthesis in automated software code generation.• The proposed approach is systematic and based on process theory.• We implemented a model-based systems and software engineering framework.• The framework has been applied to multiple industrial studies. a r t i c l e i n f o a b s t r a c t We give an overview of a model-driven systems engineering approach for high-tech systems that relies on supervisory controller synthesis. The proposed framework has a process-theoretic foundation and supports extensions with quantitative features. We briefly discuss several industrial case studies that highlight the advantages of the proposed approach.© 2013 Elsevier B.V. All rights reserved. Model-driven control software developmentEmbedding information and communication technology in consumer and industrial products was enabled by advances in software that carries most of these products' functionalities. The need for development techniques that can guarantee software quality is more than apparent. Conferences like Software Development Automation, Model-Driven Engineering Languages and Systems, or Applications of Concurrency in System Design, are some of the venues where this need has been recognized and studied by means of automated model-driven software development techniques. In this paper, we would like to point to one model-driven systems engineering approach, referred to as supervisory controller synthesis, which targets discrete-event control software for high-tech and complex systems. We find this approach to be relevant to the software development community and we hope that it might offer novel insights in development of quality control software, and bring the communities of software development, systems engineering, and formal methods closer together.

show abstract

Section: Discussionmentioning

confidence: 99%

The role of supervisory controller synthesis in automatic control software development

Baeten

Markovski

2015

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…This is like a financial system ignoring all stock values as too old or a web server dropping all client requests. Thus, we can see that this solution, advocated in [43] for its simplicity, can break the application logic itself by removing too many valid execution traces.…”

Section: Synthesis Of the Ready Task Layermentioning

confidence: 98%

“…It could be possible to adapt to our setting the on-the-fly synthesis algorithm proposed in [39]. Concerning state-space explosion, it is interesting to note Wang et al [43], who synthesise controllers for deadlock-freedom, using structural characteristics of Petri net models of the programs. This approach scales easily to very large programs, since it does not explore the full state space.…”

Section: Related Workmentioning

confidence: 99%

“…It is similar to using the sets of task states where they hold or want to hold a resource, to identify potential deadlocks. Apart from the fact that not all potential deadlocks are real, the main problem with [43] is the solution advocated -to add extra locks to render deadlocks impossible. As we have shown at the end of section 5.1, this solution is rather Procrustean, since it greatly over-constrains the valid execution traces and can break the application logic (even in non-R-T systems).…”

Section: Related Workmentioning

confidence: 99%

“…First, by attempting to synthesise the maximal controller, it applies as few constraints as possible, so when it does change the application logic it is because that is the only possible way for safely controlling the system. Second, since our methodology builds on model checking, software engineers can easily verify whether the synthesised scheduler respects basic application properties, which is not supported by the approach of [43] or these based on RMA-type analyses.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

A model-based approach for multiple QoS in scheduling: from models to implementation

Kloukinas

Yovine

2010

Autom Softw Eng

View full text Add to dashboard Cite

This is the unspecified version of the paper.This version of the publication may differ from the final published version. Abstract Meeting multiple Quality of Service (QoS) requirements is now an important factor for the success of complex software systems. This paper presents a correct-byconstruction, automated, model-driven scheduler synthesis approach for scheduling system tasks so as to meet multiple QoS requirements. As a first step, it shows how software engineers can meet deadlock-freedom and timeliness requirements, in a manner that (i) does not over-provision resources, (ii) does not require architectural changes to the system, and that (iii) leaves enough degrees of freedom to pursue further properties. The synthesis methodology directly associates each scheduler with a specific pair of QoS property and underlying platform execution model, so as to facilitate their validation and the understanding of the overall system behaviour, required to meet further QoS properties. The paper shows how the methodology is applied in practice and also presents the implementation infrastructure needed for executing an application on top of common operating systems, without requiring modifications of the operating system. Permanent repository link

show abstract

Predicting potential deadlocks in multithreaded programs

Babamir

Hassanzade

Azimpour

2015

Concurrency and Computation

View full text Add to dashboard Cite

Summary In a multithreaded program, competition of threads for shared resources raises the deadlock possibility, which narrows the system liveness. Because such errors appear in specific schedules of concurrent executions of threads, runtime verification of threads behavior is a significant concern. In this study, we extended our previous approach for prediction of runtime behavior of threads may lead to an impasse. Such a prediction is of importance because of the nondeterministic manner of competing threads. The prediction process tries to forecast future behavior of threads based on their observed behavior. To this end, we map observed behavior of threads into time‐series data sets and use statistical and artificial intelligence methods for forecasting subsequent members of the sets as future behavior of the threads. The deadlock prediction is carried out based on probing the allocation graph obtained from actual and predicted allocation of resources to threads. In our approach, we use an artificial neural network (ANN) because ANNs enjoy the applicable performance and flexibility in predicting complex behavior. Using three case studies, we contrasted results of the current and our previous approaches to demonstrate results. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

The theory of deadlock avoidance via discrete control

Cited by 56 publications

References 18 publications

The role of supervisory controller synthesis in automatic control software development

The role of supervisory controller synthesis in automatic control software development

A model-based approach for multiple QoS in scheduling: from models to implementation

Predicting potential deadlocks in multithreaded programs

Contact Info

Product

Resources

About