A process algebra with distributed priorities

DOI10.1007/3-540-61604-7_46zbMath1514.68159OpenAlexW4247534063MaRDI QIDQ6104364

No author found.

Publication date: 28 June 2023

Published in: CONCUR '96: Concurrency Theory (Search for Journal in Brave)

Full work available at URL: http://www.lib.ncsu.edu/resolver/1840.4/749

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time ⋮ An algebraic framework for urgency

Cites Work

• Observing localities
• Priorities in process algebras
• Petri net semantics of priority systems
• CCS with priority choice
• Three Partition Refinement Algorithms
• A parametric approach to localities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A process algebra with distributed priorities