Concurrency control generation for dynamic threads using Discrete-Event Systems

Auer, Anthony; Dingel, Juergen; Rudie, Karen

doi:10.1109/allerton.2009.5394896

Cited by 15 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Millan and O'Young 37 present a hybrid model that utilizes limited lookahead windows to build nonblocking supervisors. Finally, Auer et al 38 extend the limited lookahead control policy to enable concurrency scenarios. To our knowledge, there are no limited lookahead policies in the literature designed to control cooperative robot teams.…”

Section: Related Literaturementioning

confidence: 99%

Dynamic task allocation in cooperative robot teams

2011

View full text Add to dashboard Cite

Section: Related Literaturementioning

confidence: 99%

Dynamic task allocation in cooperative robot teams

2011

View full text Add to dashboard Cite

“…It also relies on automata theory to provide a well-defined syntax and semantics for modeling systems which could be very useful for specifying services. Supervisory control theory has been applied to software systems such as concurrency in multithreaded programs and component based software systems [4]. Here we apply SCT to address the problem of Web service composition.…”

Section: Introductionmentioning

confidence: 99%

Automated service composition via supervisory control theory

Atampore

Dingel

Rudie

2016

2016 13th International Workshop on Discrete Event Systems (WODES)

View full text Add to dashboard Cite

Web services play a major role in electronic businesses and allow organizations to perform certain business activities in a distributed fashion. In some circumstances, a single service is not able to perform certain tasks and it becomes imperative to compose two or more services in order to complete a task. While approaches to tackle such a problem are known, the task of generating provably correct Web service compositions still remain challenging and complex. In this paper, we develop a supervisory control framework for automated composition of Web services. Labelled Transition Systems augmented with guards and data variables are used to represent a given set of Web service specifications. We model the interactions of services asynchronously and we use guards and data variables to allow us to express certain preconditions which are then propagated from the system requirements through the overall composite service. The objective of our framework is to synthesize a controller, which interacts with a given set of Web services through messages to guarantee that a given specification is satisfied. A key novelty of this work is the application of control theory to service-oriented computing and the incorporation of run-time input into the supervisor generation process.

show abstract

Feedback Control as MAPE-K Loop in Autonomic Computing

Rutten

Marchand

Simon

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract:Computing systems are becoming more and more dynamically reconfigurable or adaptive, to be flexible w.r.t. their environment and to automate their administration. Autonomic computing proposes a general structure of feedback loop to take this into account. In this report, we are particularly interested in approaches where this feedback loop is considered as a case of control loop where techniques stemming from Control Theory can be used to design efficient safe, and predictable controllers. This approach is emerging, with separate and dispersed effort, in different areas of the field of reconfigurable or adaptive computing, at software or architecture level. This report surveys these approaches from the point of view of control theory techniques, continuous and discrete, in their application to the feedback control of computing systems, and proposes interpretations of feedback control loops as MAPE-K loop, illustrated with case studies.

show abstract

Concurrency control generation for dynamic threads using Discrete-Event Systems

Cited by 15 publications

References 12 publications

Dynamic task allocation in cooperative robot teams

Dynamic task allocation in cooperative robot teams

Automated service composition via supervisory control theory

Feedback Control as MAPE-K Loop in Autonomic Computing

Contact Info

Product

Resources

About