CCS with priority guards

CCS with Priority Guards

It has long been recognised that standard process algebra has difficulty dealing with actions of different priority, such as for instance an interrupt action of high priority. Various solutions have been proposed. We introduce a new approach, involving the addition of “priority guards” to Milner’s process calculus CCS. In our approach, priority is unstratified, meaning that actions are not assi...

CCS with Priority

It has long been recognised that standard process algebra has difficulty dealing with actions of different priority, such as for instance an interrupt action of high priority. Various solutions have been proposed. We introduce a new approach, involving the addition of “priority guards” to Milner’s process calculus CCS. In our approach, priority is unstratified, meaning that actions are not assi...

Interpreting Broadcast Communication in Ccs with Priority Choice

Wireless Localization with Vertex Guards

We consider the wireless localization problem. Given a simple polygon P , place and orient guards each of which broadcasts a unique key within a fixed angular range. At any point in the plane one must be able to tell whether or not one is located inside P only by looking at the set of keys received. In other words, the interior of the polygon must be described by a monotone Boolean formula comp...

Termination of Loop Programs with Polynomial Guards

Termination analysis of loop programs is very important in many applications, especially in those of safety critical software. In this paper, the termination of programs with polynomial guards and linear assignments is simplified to decide solvability of semi-algebraic systems(SAS). If the number of functions are finite or the functions are integer periodic, then the termination of programs is ...