Probabilistic and prioritized models of timed CSP

DOI10.1016/0304-3975(94)00171-EzbMath0874.68163MaRDI QIDQ674193

Gavin Lowe

Publication date: 28 February 1997

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

zbMATH Keywords

timed CSP

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Process Algebra and Model Checking, A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time, A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences, Algebraic theory of probabilistic processes., Probabilistic and prioritized models of timed CSP, Process algebra for performance evaluation, Probabilistic mobile ambients, The expressiveness of CSP with priority, Probabilistic Analysis of Binary Sessions, The timed failures -- Stability model for CSP, Slow Abstraction via Priority, Remarks on Testing Probabilistic Processes

Cites Work

• A brief history of Timed CSP
• Probabilistic and prioritized models of timed CSP
• Priorities in process algebras
• The timed failures -- Stability model for CSP
• Unnamed Item
• Unnamed Item