A Family of Resource-Bound Real-Time Process Algebras

DOI10.1016/J.ENTCS.2005.12.085zbMATH Open1316.68097OpenAlexW2569287041MaRDI QIDQ5262969FDOQ5262969

Oleg Sokolsky, Insup Lee, Anna Philippou

Publication date: 10 July 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2005.12.085

zbMATH Keywords

real-time process algebraprobabilistic behaviorresource modelingpower consumpion

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebra of communicating processes with abstraction
• A process algebra of communicating shared resources with dense time and priorities
• Title not available (Why is that?)

Cited In (6)

• Hiding resources that can fail: An axiomatic perspective
• A real-time process algebra with open intervals and maximal progress
• TPAP: an algebra of preemptive processes for verifying real-time systems with shared resources
• Real time process algebra
• Stochastic and Real Time in Process Algebra: A Conceptual Overview
• Title not available (Why is that?)

This page was built for publication: A Family of Resource-Bound Real-Time Process Algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262969)