Priority systems with many identical processes

DOI10.1007/BF01178682zbMath0724.68038OpenAlexW2063886314MaRDI QIDQ758201

Hsu-Chun Yen

Publication date: 1991

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01178682

zbMATH Keywords

terminationprocessespriority systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (1)

Deciding bisimulation and trace equivalences for systems with many identical processes

Cites Work

• Unnamed Item
• Reasoning about networks with many identical finite state processes
• On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
• Complete problems for deterministic polynomial time
• Priority Networks of Communicating Finite State Machines
• Automatic verification of finite-state concurrent systems using temporal logic specifications

This page was built for publication: Priority systems with many identical processes