@incollection{berry_preemption_1993,
	series = {Lecture {Notes} in {Computer} {Science}},
	title = {Preemption in concurrent systems},
	copyright = {©1993 Springer-Verlag},
	isbn = {978-3-540-57529-0, 978-3-540-48211-6},
	url = {http://link.springer.com/chapter/10.1007/3-540-57529-4_44},
	abstract = {Process preemption deals with contolling the life and death of concurrent processes. Well-defined preemption mechanisms are essential in control-dominated reactive and real-time programming, and accurate handling of preemption requires a time-dependent model. We first informally discuss what preemption is about and argue for the need of preemption primitives that are fully orthogonal with sequencing and concurrency ones. Then, we formally present the preemption operators of the Esterel zero-delay process calculus, which is a theoretical version of the Esterel synchronous programming language.},
	number = {761},
	urldate = {2014-05-16TZ},
	booktitle = {Foundations of {Software} {Technology} and {Theoretical} {Computer} {Science}},
	publisher = {Springer Berlin Heidelberg},
	author = {Berry, Gérard},
	editor = {Shyamasundar, Rudrapatna K.},
	month = jan,
	year = {1993},
	note = {00169},
	pages = {72--93}
}

{"_id":"a7iEhCQbfHXCJMDHm","bibbaseid":"berry-preemptioninconcurrentsystems-1993","downloads":0,"creationDate":"2016-10-05T13:48:43.755Z","title":"Preemption in concurrent systems","author_short":["Berry, G."],"year":1993,"bibtype":"incollection","biburl":"http://bibbase.org/zotero/alanlivio","bibdata":{"bibtype":"incollection","type":"incollection","series":"Lecture Notes in Computer Science","title":"Preemption in concurrent systems","copyright":"©1993 Springer-Verlag","isbn":"978-3-540-57529-0, 978-3-540-48211-6","url":"http://link.springer.com/chapter/10.1007/3-540-57529-4_44","abstract":"Process preemption deals with contolling the life and death of concurrent processes. Well-defined preemption mechanisms are essential in control-dominated reactive and real-time programming, and accurate handling of preemption requires a time-dependent model. We first informally discuss what preemption is about and argue for the need of preemption primitives that are fully orthogonal with sequencing and concurrency ones. Then, we formally present the preemption operators of the Esterel zero-delay process calculus, which is a theoretical version of the Esterel synchronous programming language.","number":"761","urldate":"2014-05-16TZ","booktitle":"Foundations of Software Technology and Theoretical Computer Science","publisher":"Springer Berlin Heidelberg","author":[{"propositions":[],"lastnames":["Berry"],"firstnames":["Gérard"],"suffixes":[]}],"editor":[{"propositions":[],"lastnames":["Shyamasundar"],"firstnames":["Rudrapatna","K."],"suffixes":[]}],"month":"January","year":"1993","note":"00169","pages":"72--93","bibtex":"@incollection{berry_preemption_1993,\n\tseries = {Lecture {Notes} in {Computer} {Science}},\n\ttitle = {Preemption in concurrent systems},\n\tcopyright = {©1993 Springer-Verlag},\n\tisbn = {978-3-540-57529-0, 978-3-540-48211-6},\n\turl = {http://link.springer.com/chapter/10.1007/3-540-57529-4_44},\n\tabstract = {Process preemption deals with contolling the life and death of concurrent processes. Well-defined preemption mechanisms are essential in control-dominated reactive and real-time programming, and accurate handling of preemption requires a time-dependent model. We first informally discuss what preemption is about and argue for the need of preemption primitives that are fully orthogonal with sequencing and concurrency ones. Then, we formally present the preemption operators of the Esterel zero-delay process calculus, which is a theoretical version of the Esterel synchronous programming language.},\n\tnumber = {761},\n\turldate = {2014-05-16TZ},\n\tbooktitle = {Foundations of {Software} {Technology} and {Theoretical} {Computer} {Science}},\n\tpublisher = {Springer Berlin Heidelberg},\n\tauthor = {Berry, Gérard},\n\teditor = {Shyamasundar, Rudrapatna K.},\n\tmonth = jan,\n\tyear = {1993},\n\tnote = {00169},\n\tpages = {72--93}\n}\n\n","author_short":["Berry, G."],"editor_short":["Shyamasundar, R. K."],"key":"berry_preemption_1993","id":"berry_preemption_1993","bibbaseid":"berry-preemptioninconcurrentsystems-1993","role":"author","urls":{"Paper":"http://link.springer.com/chapter/10.1007/3-540-57529-4_44"},"downloads":0},"search_terms":["preemption","concurrent","systems","berry"],"keywords":[],"authorIDs":[],"dataSources":["tudya6YojbqEiF783"]}