This paper addresses the concurrency issues affecting Behavior Trees (BTs), a popular tool to model behaviors of autonomous agents in video game and robotics industry. BT designers can easily build complex composing simpler ones, which represents key advantage BTs. The parallel composition BTs expresses way combine concurrent that has high potential, since pre-existing results easier than class...

We present a concurrency model that allows reasoning about concurrency in executable specifications of streaming applications. It provides measures for five different concurrency properties. The aim of the model is to provide insight into concurrency bottlenecks in an application and to provide global direction when performing implementationindependent concurrency optimization. The model focuse...

Process algebra semantics can be categorised into true-concurrency semantics, where parallel composition is considered a primitive operator, and interleaving semantics, where concurrency is reduced to sequentiality plus non-determinism. The former have an appealing intuitive justiication, but the latter are mathematically more tractable. This paper addresses the study of true-concurrency semant...

Models for concurrency can be classified with respect to the three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice concerning such parameters corresponds to choosing the level of abstraction of the resulting semantics. The classifications are formalized through the medium of category theory.

Asynchronous circuits is a discipline in which the theory of concurrency is applied to hardware design. This paper presents an overview of a design framework in which Petri nets are used as the main behavioral model for speciication. Techniques for synthesis, analysis and formal veriication of asynchronous circuits are reviewed and discussed.

We present a formalism for modular modeling of hybrid systems, the Cottbus Timed Automata. For the theoretical basis, we build on work about timed and hybrid automata. We use concepts from concurrency theory to model communication of separately defined modules, and we extend these concepts to be able to express explicitly readand write-access to signals and variables.

I have worked as a teaching assistant for classes on concurrency, complexity theory, algorithms, soware engineering, and introductory computer science. A typical course involved giving a series of  one-hour tutorials, supervising laboratory exercises, marking, and holding regular office hours. My tutorials were popular and well aended, and I was routinely invited to return for subsequent it...