Workshop on Graph Transformation and Concurrency
Search in this group
Group members
Workshop on Graph Transformation and Concurrency
Owner: Reiko Heckel
Group members: 13
Program
Last updated 2089 days ago by AdministratorThis is preliminary and will be updated as needed. Thursday 14:00 Introductions and Planning 16:00 Verification of GT models 19:00 Dinner (let me know if you would like to join) Friday 9:30 Model Transformations 11:00...Practical Information
Last updated 2093 days ago by Reiko HeckelThe workshop will take place in the David Wilson Library, First Floor Library Seminar Room (DW LIB SR), starting Thursday 24/01, 2pm and finishing Saturday 26/01, 12pm. For maps and travel information, see here. See the map of the...
The aim is to discuss ideas in (at least) three themes, without having to write papers or review them. To prepare the workshop, discussion fora are set up below, for general contirbutions and more thematic contributions.
General Discussion for all contributions that do not obviously fit any of the three themes below.
The three themes are
Theory: Concurrency of controlled graph transformations
For reasons of expressivity, conciseness of specification, etc. GTS are often augmented with control structures (negative application conditions, programming language-like control structures, priorities, etc).
- What does this do to existing concurrency theory?
- Do we loose the local, naturally distributed nature of basic GTS?
- What kind of control is compatible with concurrency?
- What is the relationship between different types of control structures, e.g., can one be encoded by another other?
Join the discussion to add your views, propose new problems, etc.
Models: Specifying and analysing concurrent systems
Graphical rules can model distributed protocols in an intuitive and concise way, yet provide a formal specification amenable to verification.
- Which problem domains are likely to benefit from such an approach to modelling? What properties do we want to verify there?
- Are there case studies / benchmarks to validate such claims?
- What are promising approaches to modelling and verification (language constructs used for modelling, methods and tools used for verification)?
Join the discussion to add your views, propose new problems, etc.
Programs: Development of concurrent software
GT models are executable, and with their natural model of concurrency they may be more suitable for programming concurrent systems (e.g., based on multicore/multiprocessor/distributed architectures) than traditional programming languages.
- What are the relevant platforms for which such an approach could be beneficial?
- What are the requirements for a language to support programming such platforms?
- Will such platform concepts have to be lifted into the language, e.g., providing specific synchronisation constructs?
- Can the language be platform independent, for the specialisation to be left to a compiler?
Join the discussion to add your views, propose new problems, etc.
