Communicating processes, scheduling, and the complexity of nontermination

DOI10.1007/BF02090765zbMATH Open0692.68046OpenAlexW2029679694MaRDI QIDQ3034829FDOQ3034829

Authors: 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

Recommendations

• Priority systems with many identical processes
• scientific article; zbMATH DE number 4035113
• Concurrent Probabilistic Programs, Or: How to Schedule If You Must
• Undecidability results for deterministic communicating sequential processes
• Global and local views of state fairness

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

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

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3034829)