The theory of computational complexity focuses on functions and, hence, studies programs whose interactive behavior is reduced to a simple question/answer pattern. We propose a broader theory whose ultimate goal is expressing and analyzing the intrinsic difficulty of fully general interactive behaviors. To this extent, we use standard tools from concurrency theory, including labelled transition...

Based on trace theory, we study efficient methods for concurrent integration of B-spline basis functions in IGA-FEM. We motivate the discussion with heat-equation problem discretized forward Euler time-marching scheme time and IGA-FEM space, leading to cost associated assembling Mass matrix. consider several scenarios parallelization two standard methods; classical one sum factorization. aim ef...

Concurrency is often perceived as difficult by students. One reason for this may be due to the fact that abstractions used in concurrent programs leave more situations undefined compared sequential (e.g., what order statements are executed), which makes it harder create a proper mental model of execution environment. Students who aim explore through testing further hindered non-determinism sinc...