UNSPECIFIED (2005) On implementation of global concurrent systems with local asynchronous controllers. In: 16th International Conference on Concurrency Theory, AUG 23-26, 2005, San Francisco, CA.

Full text not available from this repository.

Abstract

The classical modelization of concurrent system behaviors is based on observing execution sequences of global states. This model is intuitively simple and enjoys a variety of mathematical tools, e.g. finite automata, helping verifying concurrent systems. On the other hand, parallel composition of local controllers are needed when dealing with the actual implementation of concurrent models. A well known tool for turning global observation into local controllers is Zielonka's theorem, and its derivatives. We give here another algorithm, simpler and cheaper than Zielonka's theorem, in the case where the events observed do not include communication but only local asynchronous actions. In a developer point of view, it means that she does not have to explicitly specify the messages needed, which will be added (if allowed) automatically by the implementation algorithm.

Item Type:	Conference Item (UNSPECIFIED)
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Series Name:	LECTURE NOTES IN COMPUTER SCIENCE
Journal or Publication Title:	CONCUR 2005 - CONCURRENCY THEORY, PROCEEDINGS
Publisher:	SPRINGER-VERLAG BERLIN
ISBN:	3-540-28309-9
ISSN:	0302-9743
Editor:	Abadi, M and DeAlfaro, L
Date:	2005
Volume:	3653
Number of Pages:	15
Page Range:	pp. 443-457
Publication Status:	Published
Title of Event:	16th International Conference on Concurrency Theory
Location of Event:	San Francisco, CA
Date(s) of Event:	AUG 23-26, 2005
URI:	http://wrap.warwick.ac.uk/id/eprint/34468

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item