P♤ : A process algebra for modeling prioritized stochastic timed systems (extended abstract)
- Autores
- Domínguez, Martín Ariel; Saiz, Gerardo Javier; D'Argenio, Pedro R.
- Año de publicación
- 2003
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- We 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♤ .
Eje: Teoría (TEOR)
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
Process Algebra
Prioritized Stochastic
Modeling
Stochastic processes - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
.jpg)
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/22635
Ver los metadatos del registro completo
| id |
SEDICI_3982c3e7aeb77beb82329746be6cd0e1 |
|---|---|
| oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/22635 |
| network_acronym_str |
SEDICI |
| repository_id_str |
1329 |
| network_name_str |
SEDICI (UNLP) |
| spelling |
P♤ : A process algebra for modeling prioritized stochastic timed systems (extended abstract)Domínguez, Martín ArielSaiz, Gerardo JavierD'Argenio, Pedro R.Ciencias InformáticasProcess AlgebraPrioritized StochasticModelingStochastic processesWe 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♤ .Eje: Teoría (TEOR)Red de Universidades con Carreras en Informática (RedUNCI)2003-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf1592-1602http://sedici.unlp.edu.ar/handle/10915/22635enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:27:57Zoai:sedici.unlp.edu.ar:10915/22635Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:27:57.745SEDICI (UNLP) - Universidad Nacional de La Platafalse |
| dc.title.none.fl_str_mv |
P♤ : A process algebra for modeling prioritized stochastic timed systems (extended abstract) |
| title |
P♤ : A process algebra for modeling prioritized stochastic timed systems (extended abstract) |
| spellingShingle |
P♤ : A process algebra for modeling prioritized stochastic timed systems (extended abstract) Domínguez, Martín Ariel Ciencias Informáticas Process Algebra Prioritized Stochastic Modeling Stochastic processes |
| title_short |
P♤ : A process algebra for modeling prioritized stochastic timed systems (extended abstract) |
| title_full |
P♤ : A process algebra for modeling prioritized stochastic timed systems (extended abstract) |
| title_fullStr |
P♤ : A process algebra for modeling prioritized stochastic timed systems (extended abstract) |
| title_full_unstemmed |
P♤ : A process algebra for modeling prioritized stochastic timed systems (extended abstract) |
| title_sort |
P♤ : A process algebra for modeling prioritized stochastic timed systems (extended abstract) |
| dc.creator.none.fl_str_mv |
Domínguez, Martín Ariel Saiz, Gerardo Javier D'Argenio, Pedro R. |
| author |
Domínguez, Martín Ariel |
| author_facet |
Domínguez, Martín Ariel Saiz, Gerardo Javier D'Argenio, Pedro R. |
| author_role |
author |
| author2 |
Saiz, Gerardo Javier D'Argenio, Pedro R. |
| author2_role |
author author |
| dc.subject.none.fl_str_mv |
Ciencias Informáticas Process Algebra Prioritized Stochastic Modeling Stochastic processes |
| topic |
Ciencias Informáticas Process Algebra Prioritized Stochastic Modeling Stochastic processes |
| dc.description.none.fl_txt_mv |
We 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♤ . Eje: Teoría (TEOR) Red de Universidades con Carreras en Informática (RedUNCI) |
| description |
We 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♤ . |
| publishDate |
2003 |
| dc.date.none.fl_str_mv |
2003-10 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
| format |
conferenceObject |
| status_str |
publishedVersion |
| dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/22635 |
| url |
http://sedici.unlp.edu.ar/handle/10915/22635 |
| dc.language.none.fl_str_mv |
eng |
| language |
eng |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
| dc.format.none.fl_str_mv |
application/pdf 1592-1602 |
| dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
| reponame_str |
SEDICI (UNLP) |
| collection |
SEDICI (UNLP) |
| instname_str |
Universidad Nacional de La Plata |
| instacron_str |
UNLP |
| institution |
UNLP |
| repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
| repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
| _version_ |
1842260117878210560 |
| score |
13.13397 |