loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fourth Asia-Pacific Software Engineering and International Computer Science Conference (APSEC'97 / ICSC'97)
TPAL: A Timed-Probabilistic Model for Concurrent Processes
Clear Water Bay, HONG KONG
December 02-December 05
ISBN: 0-8186-8271-X
Antonio Bueno, Escuela Universitaria Politecnica de Albacete, SPAIN
Valentin Valero, Escuela Universitaria Politecnica de Albacete, SPAIN
Fernando Cuartero, Escuela Universitaria Politecnica de Albacete, SPAIN
We present an algebraic model for the description of concurrent systems with capabilities to express timed and probabilistic behaviours, as well as urgent interactions. This model is based on basic LOTOS, including a probabilistic choice operator, a timed prefix operator for the specification of time intervals where the involved actions are enabled, and a prefix operator for the specification of urgent interactions. An operational semantics for this model is also presented, which is based on the execution of bags. This semantics establishes that processes must always execute as many urgent actions as they can, thus complying in a great extent with the user specifications of urgent actions.
Citation:
Antonio Bueno, Valentin Valero, Fernando Cuartero, "TPAL: A Timed-Probabilistic Model for Concurrent Processes," apsec, pp.475, Fourth Asia-Pacific Software Engineering and International Computer Science Conference (APSEC'97 / ICSC'97), 1997
Usage of this product signifies your acceptance of the Terms of Use.