Communicating processes, scheduling, and the complexity of nontermination

DOI10.1007/BF02090765zbMath0692.68046OpenAlexW2029679694MaRDI QIDQ3034829

Hsu-Chun Yen

Publication date: 1990

Published in: Mathematical Systems Theory (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityschedulingcommunicating processesnontermination problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Cites Work

• Fair termination revisited - with delay
• Proof rules and transformations dealing with fairness
• An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
• The complexity of reachability in distributed communicating processes
• On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
• The complexity of problems in systems of communicating sequential processes
• Techniques for separating space complexity classes
• The covering and boundedness problems for vector addition systems
• A multiparameter analysis of the boundedness problem for vector addition systems
• Boundedness, empty channel detection, and synchronization for communicating finite automata
• On Communicating Finite-State Machines
• Priority Networks of Communicating Finite State Machines
• An Algorithm for the General Petri Net Reachability Problem
• Gradually intractable problems and nondeterministic log-space lower bounds
• Proving liveness for networks of communicating finite state machines
• Termination of Probabilistic Concurrent Program
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Communicating processes, scheduling, and the complexity of nontermination