Automated Computation of Decomposable Synchronization Conditions
| dc.contributor.author | Matos, Gilberto | en_US |
| dc.contributor.author | Purtilo, James M. | en_US |
| dc.contributor.author | White, Elizabeth | en_US |
| dc.date.accessioned | 2004-05-31T22:44:05Z | |
| dc.date.available | 2004-05-31T22:44:05Z | |
| dc.date.created | 1997-02 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | The most important aspect of concurrent and distributed computation is the interaction between system components. Integration of components into a system requires some synchronization that prevents the components from interacting in ways that may endanger the system users, its correctness or performance. The undesirable interactions are usually described using temporal logic, or safety and liveness assertions. Automated synthesis of synchronization conditions is a portable alternative to the manual design of system synchronization, and it is already widespread in the hardware CAD domain. The automated synchronization for concurrent software systems is hindered by their excessive complexity, because their state spaces can rarely be exhaustively analyzed to compute the synchronization conditions. The analysis of global state spaces is required for liveness and real--time properties, but simple safety rules depend only on the referenced components and not on the rest of the system or its environment. Synchronization conditions for delayable safety critical systems can be computed without the state space analysis, and decomposed into single component synchronization conditions. Automated synthesis of decomposable synchronization conditions provides a solid groundwork for the independent design of system components, and supports reuse and maintenance in concurrent software systems. This approach to integration of concurrent systems is embodied by GenEx, an analysis and synchronization tool that integrates system components to satisfy a given set of safety rules, and produces executable systems. (Also cross-referenced as UMIACS-TR-97-10) | en_US |
| dc.format.extent | 440179 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/875 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3748 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-97-10 | en_US |
| dc.title | Automated Computation of Decomposable Synchronization Conditions | en_US |
| dc.type | Technical Report | en_US |