Priority systems with many identical processes

DOI10.1007/BF01178682zbMATH Open0724.68038OpenAlexW2063886314MaRDI QIDQ758201FDOQ758201

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)

Cites Work

• Title not available (Why is that?)
• Reasoning about networks with many identical finite state processes
• 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

Cited In (2)

• Deciding bisimulation and trace equivalences for systems with many identical processes
• Deciding bisimulation and trace equivalences for systems with many identical processes

   Recommendations

• Communicating processes, scheduling, and the complexity of nontermination 👍 👎
• Priority Networks of Communicating Finite State Machines 👍 👎
• Title not available (Why is that?) 👍 👎
• The Power of Priority Channel Systems 👍 👎
• On the complexity of deciding fair termination of probabilistic concurrent finite-state programs 👍 👎

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)