dc.creatorDomínguez, Martín Ariel
dc.creatorSaiz, Gerardo Javier
dc.creatorD'Argenio, Pedro R.
dc.date2003-10
dc.date2003-10
dc.date2012-10-19T11:30:37Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/22635
dc.descriptionWe present P♤, a Stochastic Process Algebra (SPA) that allows for the modeling of timed systems with priorities and urgency. We de ne the semantics of P♤ in terms of Prioritized Stochastic Automata (PSA), an extension of automata with clock events, priorities and probabilistic symbolic transitions. PSAs are symbolic objects that have a concrete semantics on Probabilistic Timed Transition Systems (PTTS). Therefore, P♤ has semantics in two steps in terms of PTTS. We also de ne several operators directly on PTTS. They include parallel composition and a prioritizing operator. We show that this operators applied to PTTS commute (modulo probabilistic bisimulation) with their relatives in P♤ .
dc.descriptionEje: Teoría (TEOR)
dc.descriptionRed de Universidades con Carreras en Informática (RedUNCI)
dc.formatapplication/pdf
dc.format1592-1602
dc.languageen
dc.relationIX Congreso Argentino de Ciencias de la Computación
dc.rightshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.rightsCreative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.subjectCiencias Informáticas
dc.titleP♤ : A process algebra for modeling prioritized stochastic timed systems (extended abstract)
dc.typeObjeto de conferencia
dc.typeObjeto de conferencia


Este ítem pertenece a la siguiente institución