ACM Home Page
Please provide us with feedback. Feedback
Generation of concurrency control code using discrete-event systems theory
Full text PdfPdf (517 KB)
Source Foundations of Software Engineering archive
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering table of contents
Atlanta, Georgia
SESSION: Concurrency and transformation table of contents
Pages 146-157  
Year of Publication: 2008
ISBN:978-1-59593-995-1
Authors
Christopher Dragert  Queen's University, Kingston, Ontario, Canada
Juergen Dingel  Queen's University, Kingston, Ontario, Canada
Karen Rudie  Queen's University, Kingston, Ontario, Canada
Sponsor
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 147,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1453101.1453122
What is a DOI?

ABSTRACT

The development of controls for the execution of concurrent code is non-trivial. We show how existing discrete-event system (DES) theory can be successfully applied to this problem. From code without concurrency controls and a specification of desired behaviours, concurrency control code is generated. By applying rigorously proven DES theory, we guarantee that the control scheme is nonblocking (and thus free of both deadlock and livelock) and minimally restrictive. Some conflicts between specifications and source can be automatically resolved without introducing new specifications. Moreover, the approach is independent of specific programming or specification languages. Two examples using Java are presented to illustrate the approach. Additional applicable DES results are discussed as future work.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
L. De Alfaro, T. Henzinger, and R. Majumdar, "From Verification to Control: Dynamic Programs for Omega-Regular Objectives" in Proc. of the 16th Annual Symp. on Logic in Computer Science (LICS 2001), IEEE Computer Society Press, pp. 279--290, Washington, D.C., 2001.
2
 
3
 
4
 
5
 
6
E. Bontà, M. Bernardo, J. Magee, and J. Kramer, "Synthesizing Concurrency Control Components from Process Algebraic Specifications", in Proc. of 8th Intl. Conf. on Coordination Models and Languages, LNCS 4038, Bologna, Italy, Jun. 14--16, 2006.
 
7
P. Brinch Hansen, "The Programming Language Concurrent Pascal", in IEEE Trans. on Software Engineering, 1(2). pp. 199--207, Jun. 1975.
 
8
 
9
10
 
11
E. W. Dijkstra. "Cooperating Sequential Processes" in Programming Languages, Academic Press. New York. pp. 43--112. 1965.
12
 
13
E. A. Emerson and E. M. Clarke, "Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons" in Science of Computer Programming, Vol. 3, No. 1, pp. 241--266, 1982.
 
14
B. Goetz (with T. Peierls, J. Bloch, J. Bowbeer, D. Holmes, and D. Lea). Java Concurrency in Practice. Addison-Wesley, 2006.
 
15
 
16
17
 
18
IDES: The Integrated Discrete-Events Systems Tool, Discrete-Event Control Systems Lab, Queen's University, http://www.ece.queensu.ca/hpages/labs/discrete/software.html, Mar. 2008.
 
19
S. Jiang and R. Kumar, "Supervisory Control of Discrete Event Systems with CTL Temporal Logic Specifications", in Proc. of the 40th IEEE Conf. on Decision and Control, Orlando, FL. 2001.
 
20
Java Pathfinder, Robust Software Engineering Group, NASA Ames Research Center, Sourceforge project page. http://javapathfinder.sourceforge.net/, Mar. 2008.
 
21
G. Kiczales, J. Lamping, A. Mendhekar, C. Maeda, C. Lopes, J. Loingtier, and J. Irwin "Aspect-Oriented Programming", in Proc. of the European Conf. on Object-Oriented Programming, Vol. 1241, pp. 220--242, 1997.
 
22
 
23
24
 
25
R. Merritt. "Wintel Will Fund Parallel Software Lab at Berkeley". EE Times. http://www.eetimes.com/showArticle.jhtml?articleID=20650 3988, Feb 13, 2008.
 
26
 
27
C. Oliveira, J. E. R. Cury, C. A. A. Kaestner, "Synthesis of Supervisors for Parameterized and Non-Regular Discrete Event Systems", in 1st IFAC Workshop on Dependable Control of Discrete Systems (DCDS 07), 2007.
 
28
J. S. Ostroff and W. M. Wonham, "A Framework for Real-Time Discrete-Event Control", in IEEE Trans. on Automatic Control, Vol. 35, Issue 4, pp. 386--397, Apr. 1990.
 
29
 
30
Σoφíα: A Java Bytecode Analysis Tool, http://sofya.unl.edu/, Mar. 2008.
 
31
H. Sutter. "The Free Lunch is Over: A Fundamental Turn toward Concurrency in Software", in Dr. Dobb's Journal, Vol 30, No. 3, Mar. 2005.
 
32
J. G. Thistle and W. M. Wonham, "Control Problems in a Temporal Logic Framework", in Intl. Journal of Control, Vol. 44, No. 4, pp. 943--976, 1986.
 
33
TCT, Systems and Control Group, Dept. of Electrical and Computer Engineering, University of Toronto, http://www.control.toronto.edu/DES, Mar. 2008.
 
34
W. M. Wonham and P. J. Ramadge, "Modular Supervisory Control of Discrete Event Systems," in Mathematics of Control, Signal and Systems, pp. 13--30, 1988.
 
35
P. H. Welch, G. S. Stiles, G. H. Hilderink, and A. P. Bakkers. "CSP for Java: Multithreading for All", in Architectures, Languages and Techniques for Concurrent Systems, Vol. 57, pp 227--299, Amsterdam, the Netherlands, April 1999.
36
 
37
R. Ziller and K. Schneider, "A μ-Calculus Approach to Supervisor Synthesis", in Workshop Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen, pp. 132--143, 2003.
38
 
39
H. Zhong, W. M. Wonham, "On the Consistency of Hierarchical Supervision in Discrete-Event Systems", in IEEE Trans. on Automatic Control, Vol. 35, No. 10, pp. 1125--1134, Oct. 1990


Collaborative Colleagues:
Christopher Dragert: colleagues
Juergen Dingel: colleagues
Karen Rudie: colleagues