The identification of business process models within large model collections poses a significant challenge. Process querying offers a solution by selecting models that meet specific characteristics, utilizing queries based on behavioral relations. These relations, which include conflict, co-occurrence, causality, and concurrency (collectively known as the 4C Spectrum), describe the potential interactions between tasks within process models during execution. However, existing approaches to compute these behavioral relations are inefficient for models with numerous execution traces, often requiring extensive time. This paper introduces a set of algorithms, termed “Behavioral Relation Computations” (in short BeRelCo), capable of identifying all 4C Spectrum behavioral relations within acyclic sound free-choice workflow nets with quadratic time complexity \({O(P^2 + T^2)}\) . Our experiments demonstrate significant benefits, particularly for process models characterized by many execution traces.