Concurrency Theory Group Department of Computer Science University of Kaiserslautern
|
Welcometo the webpages of the Concurrency Theory Group. Our team investigates the foundations of concurrent behaviour in network applications, remote programs, and multi-threaded software. Our ambition is to understand the underlying principles and exploit them in the design of highly efficient analysis algorithms. Harnessing methods from computability theory, computer-aided verification, and formal languages, the group is specialised in inference techniques for qualitative as well as quantitative properties, and currently extends state space exploration algorithms towards automatic system correction and optimisation.The working group has just been founded - in July 2010. We hold excellent international contacts to the Universities of Bologna and Newcastle, as well as the research institutes LIAFA and LSV in Paris. If you would like to join us, if you are interested in a Bachelor's, Master's, or PhD thesis, or in case you are just curious about who we are - we warmly welcome you to visit us. We offer beautiful topics, competitive scholarships, and an international research environment. To learn more about our area, consider attending the winter term lecture Concurrency Theory. A German description of our working group can be found here. Roland Meyer, head of the group. |
NewsFASE 2012.Language-Theoretic Abstraction Refinement.  publications by Georgel
INFINITY 2012. Roland Meyer is a member of the programme committee. More about the workshop can be found here
FSTTCS 2011. Petri Net Reachability Graphs: Decidability Status of FO Properties. publications by Roland
ACSD 2012. Roland Meyer is a member of the programme committee. More about the conference can be found here
D-CON 2012 will be organised by the Concurrency Theory Group. The workshop takes place on the 08th and 09th of March 2012. More about the workshop can be found here
YR-CONCUR 2011. Roland Meyer is a member of the programme committee. More about the conference can be found here
Theorietag 2011. Georg is giving an invited talk on erasing productions in grammars with regulated rewriting. Homepage
ICALP 2011. Deciding robustness against total store ordering. publications by Roland
ICALP 2011. On the capabilities of grammars, automata and transducers controlled by monoids. publications by Georg
DLT 2011. A sufficient condition for erasing productions to be avoidable. publications by Georg
ACSD 2011. Roland Meyer is a member of the programme committee. More about the conference can be found here
CONCUR 2010. Kleene, Rabin, and Scott are available. pdf
all publications
ICALP 2010. The downward-closure of Petri net languages. pdf
all publications
CAV 2010. Petruchio: from dynamic networks to nets. pdf
all publications
OffersOpen position as a technical assistant.We are looking for students with experience in server maintenance, linux networks, and web page design. The job will also provide you with hands-on experience in performance evaluation of scientific algorithms - including the set-up of large-scale experiments. If you are interested, contact Roland Meyer
Theses. Experience international collaborations, discuss with leading researchers, and put forward the state-of-the-art in concurrency theory. We offer Bachelor's, Master's, and PhD theses. more information
Master's courses. Attend our lecture on Concurrency Theory in winter 2011/2012. Fits as theory course or specialisation on Algorithmics, Verification, and Embedded Systems. teaching
Theory seminar. Our seminar takes place on Fridays, 2pm, in 34/420. We welcome you to join us! |
| http://concurrency.cs.uni-kl.de |
|
