Filters








8,921 Hits in 2.2 sec

CCS with Priority Guards [chapter]

Iain Phillips
2001 Lecture Notes in Computer Science  
We introduce a new approach, involving the addition of "priority guards" to Milner's process calculus CCS.  ...  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.  ...  The language CPG We shall denote our augmentation of CCS with priority guards by CPG (CCS with Priority Guards). First we define the actions of CPG.  ... 
doi:10.1007/3-540-44685-0_21 fatcat:ricaqo4dzzgwbfelcaqznd24lu

CCS with priority guards

Iain Phillips
2008 The Journal of Logic and Algebraic Programming  
We introduce a new approach, involving the addition of "priority guards" to Milner's process calculus CCS.  ...  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.  ...  The language CPG We shall denote our augmentation of CCS with priority guards by CPG (CCS with Priority Guards). First we define the actions of CPG.  ... 
doi:10.1016/j.jlap.2007.06.005 fatcat:cyftbojidzakpnzifckn7kjvim

Reasoned Modelling Critics: Turning Failed Proofs into Modelling Guidance [chapter]

Andrew Ireland, Gudmund Grov, Michael Butler
2010 Lecture Notes in Computer Science  
Inspired by proof planning critics, the technique combines proof-failure analysis with modelling heuristics. Here, we present the details of our proposal and outline future plans.  ...  Our thanks go to Alan Bundy, who motivated the use of variable priorities.  ...  Thanks also go to Jean-Raymond Abrial, Cliff Jones, Ewen Maclean and Maria Teresa Llano Rodriguez for their feedback and encouragement with this work.  ... 
doi:10.1007/978-3-642-11811-1_15 fatcat:bcraqx4kfvafnkkmpfwix6i3oq

Reasoned modelling critics: Turning failed proofs into modelling guidance

Andrew Ireland, Gudmund Grov, Maria Teresa Llano, Michael Butler
2013 Science of Computer Programming  
Inspired by proof planning critics, the technique combines proof-failure analysis with modelling heuristics. Here, we present the details of our proposal and outline future plans.  ...  Our thanks go to Alan Bundy, who motivated the use of variable priorities.  ...  Thanks also go to Jean-Raymond Abrial, Cliff Jones, Ewen Maclean and Maria Teresa Llano Rodriguez for their feedback and encouragement with this work.  ... 
doi:10.1016/j.scico.2011.03.006 fatcat:xyq4kbbaerdphardgqcub5btai

QoS negotiation in service composition

Maria Grazia Buscemi, Ugo Montanari
2011 The Journal of Logic and Algebraic Programming  
We prove that our choice operator is more general than a choice operator with static priority.  ...  In this work we propose a variant of the cc-pi calculus in which the alternatives in a choice rather than being selected non-deterministically have a dynamic priority.  ...  Specification in cc-pi with static priorities.  ... 
doi:10.1016/j.jlap.2010.04.001 fatcat:mhf4m2co3fbs3lesdsjtbaxq3q

The Concurrency Workbench with priorities [chapter]

Claus Torp Jensen
1992 Lecture Notes in Computer Science  
This paper presents an extension of Milner's CCS with a priority choice operator accompanied by a suitable notion of bisimulation and a characterizing modal logic.  ...  Only guarded recursions are allowed. The syntax restricts guards (the agents in priority constructs) so that they do not contain output actions on the top level (this is consistent with OCCAM).  ...  Background Many everyday systems include alternative activities with different priorities.  ... 
doi:10.1007/3-540-55179-4_15 fatcat:pjirtt3ehbdejmavtal3qlfqhm

Preferential choice and coordination conditions

J.A. Bergstra, C.A. Middelburg
2007 The Journal of Logic and Algebraic Programming  
Preferential choices are often modelled rather indirectly using a priority mechanism.  ...  With those conditions, it becomes easy to model preferential choices.  ...  . , a n } : a . p with priority guards. The following shows an inconvenience of priority guards: −(E a 1 . . .  ... 
doi:10.1016/j.jlap.2006.08.004 fatcat:yqaf6v42o5dc3azmc3w57ux6qa

On the Expressive Power of Restriction and Priorities in CCS with Replication [chapter]

Jesús Aranda, Frank D. Valencia, Cristian Versari
2009 Lecture Notes in Computer Science  
(CCS with replication instead of recursion) which differ from each other in the use of restriction with respect to replication. We consider three syntactic variations of CCS !  ...  We study the expressive power of restriction and its interplay with replication. We do this by considering several syntactic variants of CCS !  ...  For this purpose we shall consider CCS −!ν !+pr which is CCS −!ν ! extended with Phillips' priority guards construct [17] . Classifying Criteria.  ... 
doi:10.1007/978-3-642-00596-1_18 fatcat:nlg23ancbbb7dbdvddqrmvszvq

A calculus of broadcasting systems

K.V.S. Prasad
1995 Science of Computer Programming  
The change from handshake communication in CCS to broadcast in CBS permits several advances. (1) Priority, which attaches only to autonomous actions, is simply added to CBS in contrast to CCS, where such  ...  This permits a powerful combination, CBS with the host language. It yields several elegant algorithms.  ...  CCS with priorities. Adding priorities to CCS [ 14, 111 is difficult, involving twostage operational semantics and other complications.  ... 
doi:10.1016/0167-6423(95)00017-8 fatcat:ay2gekrvfzeclkgvfxd65tdtn4

Incremental and Commutative Composition of State-Machine Models of Features

Sandy Beidu, Joanne M. Atlee, Pourya Shaker
2015 2015 IEEE/ACM 7th International Workshop on Modeling in Software Engineering  
state-machines (or state-machine fragments) modelled in a feature-oriented requirement modelling language called FORML and the outputs are two state-machine models: (1) a model of the whole product line with  ...  optional features guarded by presence conditions; this model is suitable for family-based analysis of the product line; and (2) an intermediate model of composition that facilitates incremental composition  ...  An override differs from a transition priority in that the enabling condition of t2 implicitly has the same enabling conditions as t1, but could be strengthened with an additional guard c.  ... 
doi:10.1109/mise.2015.10 dblp:conf/icse/BeiduAS15 fatcat:okilccgearbepblazguxxhteou

Priority and maximal progress are completely axiomatisable (extended abstract) [chapter]

Holger Hermanns, Markus Lohrey
1998 Lecture Notes in Computer Science  
During the last decade, CCS has been extended in di erent directions, among them priority and real time.  ...  This problem also arises in calculi with priority. So, completeness results for such calculi modulo observational congruence have been unknown until now.  ...  A variable X is strongly guarded in an expression E if every occurrence of X in E is strongly guarded, i.e. guarded by a pre x \a:" (with a 6 = ) or \( ):".  ... 
doi:10.1007/bfb0055626 fatcat:eu3c634bc5elbkem3piqob277a

A NEW QoS GUARANTEE SLA BASED-SCHEME FOR HANDOFF CALLS IN WIRELESS NETWORKS

Nguyen Cao Phuong, Tran Hong Quan, Sang-Ho Lee, Jung-Mo Moon
2017 ASEAN Journal on Science and Technology for Development  
In our scheme, we use guard channel scheme with finite buffer for handoff calls.  ...  hh h h C C j C C j CC C n h n h h j j C C P jj                     (2) Priority with reserved channel and queue traffic handoffs based on SLA scheme In order to reduce the dropping  ... 
doi:10.29037/ajstd.231 fatcat:wlujskjozzdybbs7cqpmcvkum4

Page 686 of IEEE Transactions on Computers Vol. 52, Issue 5 [page]

2003 IEEE Transactions on Computers  
streams with lower priorities become thinner.  ...  Recently, Ramjee et al. ({[5]) proposed a so-called fractional guard channel scheme for the call admission control for wireless networks with two priorities traffic (new calls and handoff calls).  ... 

Priorities Without Priorities: Representing Preemption in Psi-Calculi

Johannes Åman Pohjola, Joachim Parrow
2014 Electronic Proceedings in Theoretical Computer Science  
To accomplish this we define an extension of psi-calculi with action priorities, and show that for every calculus in the extended framework there is a corresponding ordinary psi-calculus, without priorities  ...  We also formally prove in Nominal Isabelle that the standard congruence and structural laws about strong bisimulation hold in psi-calculi extended with priorities.  ...  calculus [15] ; Jensen shows that CCS augmented with priority choice can encode broadcast communication [16] ; and Versari et al. shows that CCS with priority and only the prefix and parallel operators  ... 
doi:10.4204/eptcs.160.2 fatcat:ljnbyxyglreldan6v2oxhoozgq

Broadcasting with priority [chapter]

K. V. S. Prasad
1994 Lecture Notes in Computer Science  
This paper adds priorities to a calculus of broadcasting systems (CBS) [Pra93c 1. The resulting CBS with priorities (PCBS) is strikingly simple, and compares very favourably with CCS with priorities.  ...  Adding priorities to CCS is difficult, and involves two-stage operational semantics or other complications.  ...  CCS WITH PRIORITIES The difficulties in adding priorities to CCS can be traced to the fact that handshake communication makes an autonomous action out of two controlled ones.  ... 
doi:10.1007/3-540-57880-3_31 fatcat:eswq37drqrcbheodtp7usrzifq
« Previous Showing results 1 — 15 out of 8,921 results