In the perspective next generation Air Traffic Management (ATM) systems, aircraft will be endowed with part of the responsibility for separation maintenance, and traffic complexity...
Abstract. In [She82], it is shown that four of its basic functional properties are enough to characterize plain Kolmogorov complexity, hence obtaining an axiomatic characterization...
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...