Abstract | ||
---|---|---|
We have proposed a formal semantics for a programming language that supports the announcement of events. Based on this semantics, it is clear that event-based systems share some substantial properties with parallel systems. In particular, announcing an event results in the parallel execution of subscribers to this event with the remainder of the announcing program. In this paper, we show how usual concurrency concepts such as synchronization and mutual exclusion can be supported in the stepwise development of event-based applications. The approach in this paper is based on Jones's rely/guarantee method for the development of interfering programs. We also show how deadlock free event-based applications can be developed. Finally, the paper extends Stolen's technique of handling auxiliary variables to support the development of more complex event-based applications. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1007/978-3-540-45236-2_35 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
event-based systems,parallel systems,rely/guarantee,deadlock,auxiliary variables | Synchronization,Parallel algorithm,Computer science,Concurrency,Deadlock,Real-time computing,Theoretical computer science,Reactive system,Mutual exclusion,Semantics,Software development,Distributed computing | Conference |
Volume | ISSN | Citations |
2805 | 0302-9743 | 2 |
PageRank | References | Authors |
0.37 | 11 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Pascal Fenkam | 1 | 123 | 11.85 |
Harald Gall | 2 | 3858 | 263.82 |
Mehdi Jazayeri | 3 | 1280 | 176.00 |