Priority systems with many identical processes
From MaRDI portal
Recommendations
- Communicating processes, scheduling, and the complexity of nontermination
- Priority Networks of Communicating Finite State Machines
- scientific article; zbMATH DE number 3881887
- The Power of Priority Channel Systems
- On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
Cites work
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Complete problems for deterministic polynomial time
- On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
- Priority Networks of Communicating Finite State Machines
- Reasoning about networks with many identical finite state processes
Cited in
(5)- Communicating processes, scheduling, and the complexity of nontermination
- Deciding bisimulation and trace equivalences for systems with many identical processes
- Deciding bisimulation and trace equivalences for systems with many identical processes
- Termination and Divergence Are Undecidable Under a Maximum Progress Multi-step Semantics for LinCa
- The power of priority channel systems
This page was built for publication: Priority systems with many identical processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q758201)