Probabilistic and prioritized models of timed CSP
type: Item
instance of: scholarly article
title: Probabilistic and prioritized models of timed CSP
zbMATH Open document ID: 0874.68163
DOI: 10.1016/0304-3975(94)00171-E
author: Gavin Lowe
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 985985
zbMATH Keywords: timed CSP
MaRDI profile type: Publication
cites work: Priorities in process algebras
cites work: A brief history of Timed CSP
cites work: Q3777424
cites work: The timed failures -- Stability model for CSP
cites work: Q3787461
Recommended article: Non-determinism and Probabilities in Timed Concurrent Constraint Programming
Recommended article: A branching time model of CSP
Recommended article: An operational semantics for timed CSP
Recommended article: Validation of Stochastic Systems
Recommended article: A Decidable Probability Logic for Timed Probabilistic Systems
Recommended article: Probabilistic and Topological Semantics for Timed Automata
Recommended article: Polytime model checking for times probabilistic computation tree logic
description: scientific article; zbMATH DE number 985985