On some combinatorial properties of Linux process trees

DOI10.22405/2226-8383-2018-19-2-151-162MaRDI QIDQ5109639zbMATH OpenOpenAlexFDO

Authors Nikolaĭ Nikolaevich Efanov

Publication date 13 May 2020

Published in Chebyshevskii sbornik (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/cheb646

zbMATH Keywords

checkpoint restoreenumeration combinatoricsformal grammarsgroupsmathematical modelingprocess treesystem callstreesUnix-like operating systems

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Theory of operating systems (68N25) Data structures (68P05) Grammars and rewriting systems (68Q42) Combinatorics in computer science (68R05)

Recommendations

• On semilattice of Linux processes' states
• Associativity for binary parallel processes: a quantitative study
• scientific article; zbMATH DE number 1246231
• A process-calculus analysis of concurrent operations on B-trees
• scientific article; zbMATH DE number 3845635

Cites work

• Defining contexts in context-free grammars
• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• Introduction to algorithms
• Multi-Component Tree Insertion Grammars

Cited in

(2)

• On the properties of a tree-structured server process
• On semilattice of Linux processes' states

This page was built for publication: On some combinatorial properties of Linux process trees

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