Title :
Using CSP to Model and Analyze TinyOS Applications
Author :
McInnes, Allan I.
Author_Institution :
Electr. & Comput. Eng., Univ. of Canterbury, Christchurch
Abstract :
The TinyOS concurrency model, although easier to reason about than shared-state threads, may still produce undesirable behavior as a result of unexpected interleaving of concurrent activities. This is problematic, since TinyOS applications are typically intended to run unattended for long periods of time, and must be reliable. In this paper, we describe a technique for modeling the interactions between TinyOS application components, and between an application and the TinyOS scheduling and preemption mechanisms, using the process algebra CSP. Analysis of the resulting process models can help TinyOS application developers to discover and diagnose concurrency-related errors in their designs that might otherwise go undetected until deployment of the application.
Keywords :
communicating sequential processes; concurrency theory; network operating systems; scheduling; TinyOS application component; TinyOS concurrency model; TinyOS scheduling; communicating sequential processes; preemption mechanism; process algebra; shared-state thread; Algebra; Application software; Concurrent computing; Conferences; Electronic mail; Hardware; Interleaved codes; Operating systems; Processor scheduling; Time factors; Concurrency; Process algebra; TinyOS;
Conference_Titel :
Engineering of Computer Based Systems, 2009. ECBS 2009. 16th Annual IEEE International Conference and Workshop on the
Conference_Location :
San Francisco, CA
Print_ISBN :
978-0-7695-3602-6
DOI :
10.1109/ECBS.2009.34
