Working with True Concurrency

This is a general topic regarding modern concurrency models and their various theoretical and practical aspects. Here the student can choose various topics to focus on, depending on the interest, which we find out together through discussions.

One can do various kinds of MSc theses, starting from just programming a simple tool related to some forms of concurrency, or a literature study, or doing modelling of real-life concurrent systems, or develop a concurrent programming/modelling languge, or doing mathematical work on the logical foundations of all these models and their tools.

Ask for discussions with one of the supervisors, for more information or variations of the project. See also general concerns.

Programming with True Concurrency

This project will look into the possibilities of programming concurrent software using the event-based concurrency paradigm. The project will investigate programming constructs in the various event-based models. Simple programming examples are to be investigated. The project could also involve the development of related programming tools.

See project link.

Verifying Properties of True Concurrent Systems

This project involves investigations into the verification aspects of true concurrency models. This topic can involve studying logics for one of the event-based formalisms. It can involve study of the decision problems related to verification of properties for systems specified using event-based or partial orders-based models of concurrency. This topic is more challenging than standard verification of sequential systems, also because there are negative results about undecidability of some problems for some of the partial order-based models.

See project link.

Highly Expressive True Concurrency Models

This topic involves investigation into the expressive power of existing true concurrency models. It would involve understanding of the highly expressive models like Higher Dimensional Automata, or event structures, or configuration structures. It would involve comparative investigations into other existing related formalisms. This topic can also involve extensions of existing formalisms to capture additional aspects of concurrent systems, like agency, time, uncertainty, or communication.

See project link.

Tools for visualizing and working with Higher Dimensional Automata (model of concurrency)

This topic involves understanding the formalism of Higher Dimensional Automata (HDA) and then developing visualization techniques for these. Alongside a software tool for visualizing HDA will be developed. HDA are the most expressive model of concurrency. HDA are normally thought in higher geometrical spaces (this means not just 3D). One can also investigate a visual development tool, which will not just visualize the HDA but also allow the user to define/construct HDA models in the graphical manner.

See project link.

Logics for Higher Dimensional Automata

This topic studies the few existing logics for the model of true concurrency called Higher Dimensional Automata. The topic can also consider logics for other models of concurrency. There are many open problems in this area, hence, many opportunities.

See project link.

Working with the mathematical model of concurrency Chu Spaces

Modeling concurrent systems with Chu spaces and using the tool Chu Calculator. This topic is for a more mathematically inclined person, but the project is about applying and using the mathematical framework/theory of Chu spaces.

See project link.

Equivalences for True Concurrent Systems

This topic involves investigation of the literature on equivalence notions and true concurrency systems. After a preliminary understanding of the basic notions involved, more interesting theoretical contributions will be investigated. There is also place for implementations, but this topic is mostly theoretical. More details are given on request.

See project link.

Tags: true concurrency, Programming, visualizing tools, higher dimensional automata, model checking, expressiveness, Chu spaces, Mathematics, Logic, bisimulation
Published Aug. 25, 2017 10:03 AM - Last modified Aug. 19, 2018 1:11 PM


Scope (credits)