(Tagungsband des FG-BS Herbsttreffens 2024, 2024) Hövelmann, Thomas Alexander; Krause, Alexander; Ulbrich, Peter
Path expressions provide a precise and concise method for defining synchronization rules for accessing shared data. In conjunction with predicates, even finer control of the sequences can be achieved. Furthermore, path expressions, with their ability to abstract from a specific synchronization technique, demonstrate a high level of adaptability. Despite being developed nearly five decades ago, they remain underrepresented in current software engineering and have yet to achieve widespread applicability. This paper reevaluates existing approaches and presents an automaton-based version of path expressions written in C++. We extend the concept of predicates to allow access to external system states and evaluate the feasibility and performance of our approach.
