Deadlock and fairness in parallel schemas: A set-theoretic characterization and decision problems

DOI10.1016/0020-0190(80)90148-9zbMath0445.68008OpenAlexW1994177926MaRDI QIDQ1145493

Ludwik Czaja

Publication date: 1980

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90148-9

zbMATH Keywords

fairnessdecidabilitystarvationdeadlockparallel schemas

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel system schemas and their relation to automata
• A specification of parallel problems
• Derivatives of Regular Expressions

This page was built for publication: Deadlock and fairness in parallel schemas: A set-theoretic characterization and decision problems