J u m p t o c o n t e n t
M a i n m e n u
M a i n m e n u
N a v i g a t i o n
● M a i n p a g e ● C o n t e n t s ● C u r r e n t e v e n t s ● R a n d o m a r t i c l e ● A b o u t W i k i p e d i a ● C o n t a c t u s ● D o n a t e
C o n t r i b u t e
● H e l p ● L e a r n t o e d i t ● C o m m u n i t y p o r t a l ● R e c e n t c h a n g e s ● U p l o a d f i l e
S e a r c h
Search
A p p e a r a n c e
● C r e a t e a c c o u n t ● L o g i n
P e r s o n a l t o o l s
● C r e a t e a c c o u n t ● L o g i n
P a g e s f o r l o g g e d o u t e d i t o r s l e a r n m o r e ● C o n t r i b u t i o n s ● T a l k
( T o p )
1 E d i t i o n s
2 T e s t - o f - T i m e A w a r d
T o g g l e T e s t - o f - T i m e A w a r d s u b s e c t i o n
2 . 1 2 0 2 3
2 . 1 . 1 P e r i o d 2 0 0 2 – 2 0 0 5
2 . 2 2 0 2 2
2 . 2 . 1 P e r i o d 2 0 0 0 – 2 0 0 3
2 . 2 . 2 P e r i o d 1 9 9 8 – 2 0 0 1
2 . 3 2 0 2 1
2 . 3 . 1 P e r i o d 1 9 9 6 – 1 9 9 9
2 . 3 . 2 P e r i o d 1 9 9 4 – 1 9 9 7
2 . 4 2 0 2 0
2 . 4 . 1 P e r i o d 1 9 9 2 – 1 9 9 5
2 . 4 . 2 P e r i o d 1 9 9 0 – 1 9 9 3
3 A f f i l i a t e d e v e n t s
4 S e e a l s o
5 R e f e r e n c e s
6 E x t e r n a l l i n k s
T o g g l e t h e t a b l e o f c o n t e n t s
I n t e r n a t i o n a l C o n f e r e n c e o n C o n c u r r e n c y T h e o r y
A d d l a n g u a g e s
A d d l i n k s
● A r t i c l e ● T a l k
E n g l i s h
● R e a d ● E d i t ● V i e w h i s t o r y
T o o l s
T o o l s
A c t i o n s
● R e a d ● E d i t ● V i e w h i s t o r y
G e n e r a l
● W h a t l i n k s h e r e ● R e l a t e d c h a n g e s ● U p l o a d f i l e ● S p e c i a l p a g e s ● P e r m a n e n t l i n k ● P a g e i n f o r m a t i o n ● C i t e t h i s p a g e ● G e t s h o r t e n e d U R L ● D o w n l o a d Q R c o d e ● W i k i d a t a i t e m
P r i n t / e x p o r t
● D o w n l o a d a s P D F ● P r i n t a b l e v e r s i o n
A p p e a r a n c e
F r o m W i k i p e d i a , t h e f r e e e n c y c l o p e d i a
The International Conference on Concurrency Theory (CONCUR ) is an academic conference in the field of computer science , with focus on the theory of concurrency and its applications. It is the flagship conference for concurrency theory according to the International Federation for Information Processing Working Group on Concurrency Theory (WP 1.8 ).[1] LIPIcs–Leibniz International Proceedings in Informatics , a "series of high-quality conference proceedings across all fields in informatics established in cooperation with Schloss Dagstuhl –Leibniz Center for Informatics".[2] [3] Lecture Notes in Computer Science .[4]
Editions [ edit ]
34th CONCUR 2023: Antwerp, Belgium[7]
33rd CONCUR 2022: Warsaw, Poland[8]
32nd CONCUR 2021: Paris, France Online[9]
31st CONCUR 2020: Vienna, Austria Online[10]
30th CONCUR 2019: Amsterdam, the Netherlands[11]
29th CONCUR 2018: Beijing, China[12]
28th CONCUR 2017: Berlin, Germany[13]
27th CONCUR 2016: Québec City, Canada[14]
26th CONCUR 2015: Madrid, Spain
25th CONCUR 2014: Rome, Italy
24th CONCUR 2013: Buenos Aires, Argentina
23rd CONCUR 2012: Newcastle upon Tyne, UK
22nd CONCUR 2011: Aachen, Germany
21st CONCUR 2010: Paris, France
20th CONCUR 2009: Bologna, Italy
19th CONCUR 2008: Toronto, Canada
18th CONCUR 2007: Lisbon, Portugal
17th CONCUR 2006: Bonn, Germany
16th CONCUR 2005: San Francisco, CA, USA
15th CONCUR 2004: London, UK
14th CONCUR 2003: Marseille, France
13th CONCUR 2002: Brno, Czech Republic
12th CONCUR 2001: Aalborg, Denmark
11th CONCUR 2000: Pennsylvania State University, Pennsylvania, USA
10th CONCUR 1999: Eindhoven, The Netherlands
9th CONCUR 1998: Nice, France
8th CONCUR 1997: Warsaw, Poland
7th CONCUR 1996: Pisa, Italy
6th CONCUR 1995: Philadelphia, PA, USA
5th CONCUR 1994: Uppsala, Sweden
4th CONCUR 1993: Hildesheim, Germany
3rd CONCUR 1992: Stony Brook, NY, USA
2nd CONCUR 1991: Amsterdam, the Netherlands
1st CONCUR 1990: Amsterdam, the Netherlands
Concurrency: Theory, Language, And Architecture 1989: Oxford, UK
Concurrency 1988: Hamburg, Germany
Seminar on Concurrency 1984: Pittsburgh, PA, USA
Test-of-Time Award [ edit ]
In 2020, the International Conference on Concurrency Theory (CONCUR) and the IFIP Working Group 1.8 on Concurrency Theory
established the CONCUR Test-of-Time Award.
The goal of the Award is to recognize important achievements in concurrency theory that
have stood the test of time, and were published at CONCUR since its first edition in 1990.[15]
Starting with CONCUR 2024, an award event will take
place every other year, and recognize one or two papers presented at CONCUR in the 4-year period from 20 to 17 years earlier.
From 2020 to 2023 two such award events are combined each year, in order to also recognize achievements that appeared
in the early editions of CONCUR.[16]
Period 2002–2005 [ edit ]
Vincent Danos, Jean Krivine: "Reversible Communicating Systems." (CONCUR 2004)[17]
Period 2000–2003 [ edit ]
Period 1998–2001 [ edit ]
Franck Cassez & Kim Larsen: "The Impressive Power of Stopwatches" (CONCUR 2000)[18]
Christel Baier , Joost-Pieter Katoen & Holger Hermanns: "Approximate symbolic model checking of continuous-time Markov chains." (CONCUR 1999)[18]
Period 1996–1999 [ edit ]
Period 1994–1997 [ edit ]
Uwe Nestmann & Benjamin C. Pierce : "Decoding Choice Encodings" (CONCUR 1996)[15]
David Janin & Igor Walukiewicz: "On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic." (CONCUR 1996)[15]
Period 1992–1995 [ edit ]
Roberto Segala & Nancy Lynch : "Probabilistic Simulations for Probabilistic Processes" (CONCUR 1994)[16]
Davide Sangiorgi : "A Theory of Bisimulation for the pi-Calculus" (CONCUR 1993)[16]
Period 1990–1993 [ edit ]
Rob van Glabbeek: "The Linear Time-Branching Time Spectrum" (CONCUR 1993)[16]
Søren Christensen, Hans Hüttel & Colin Stirling: "Bisimulation Equivalence is Decidable for all Context-Free Processes" (CONCUR 1992)[16]
Affiliated events [ edit ]
International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS)
International Conference on Quantitative Evaluation of SysTems (QEST)
See also [ edit ]
References [ edit ]
^ "dblp: CONCUR 2015" . dblp.org . Retrieved 2019-02-03 .
^ "dblp: Concurrency 1988" . dblp.org . Retrieved 2019-02-03 .
^ "CORE 2021 - CONCUR" . portal.core.edu.au . Retrieved 2023-04-01 .
^ "CONCUR - Google Scholar Metrics" . scholar.google.dk . Retrieved 2019-07-20 .
^ "CONCUR 2023" . CONCUR 2023 . Retrieved 2023-09-20 .
^ "CONCUR 2022" . CONCUR 2022 . Retrieved 2023-04-25 .
^ "CONCUR 2021" . Qonfest 2021 . Retrieved 2021-04-26 .
^ "CONCUR 2020" . CONCUR 2020 . Retrieved 2023-04-25 .
^ "CONCUR 2019 - AMSTERDAM" . event.cwi.nl . Retrieved 2019-02-03 .
^ "CONCUR 2018 - BEIJING" . lcs.ios.ac.cn . Retrieved 2019-02-03 .
^ "CONCUR 2017" . www.concur2017.tu-berlin.de . Retrieved 2019-02-03 .
^ "CONCUR2016: Home" . www.concur2016.ulaval.ca . Retrieved 2019-02-03 .
^ a b c d e Bertrand, Nathalie; de Alfaro, Luca; van Glabbeek, Rob; Palamidessi, Catuscia ; Yoshida, Nobuko (2021). "CONCUR Test-Of-Time Award 2021" (PDF) . CONCUR . Leibniz International Proceedings in Informatics (LIPIcs). 203 : 1:1–1:3. doi :10.4230/LIPIcs.CONCUR.2021.1 . ISBN 9783959772037
^ a b c d e Aceto, Luca; Baeten, Jos; Bouyer-Decitre, Patricia; Hermanns, Holger; Silva, Alexandra (2020). "CONCUR Test-Of-Time Award 2020 Announcement" (PDF) . CONCUR . Leibniz International Proceedings in Informatics (LIPIcs). 171 : 5:1–5:3. doi :10.4230/LIPIcs.CONCUR.2020.5 . ISBN 9783959771603
^ "Concur 2023 Test of Time Award" . Concur 2023 website . Retrieved 20 September 2023 .
^ a b c d "Concur 2022 Test of Time Award" . Concur 2022 website . Retrieved 9 November 2022 .
External links [ edit ]
R e t r i e v e d f r o m " https://en.wikipedia.org/w/index.php?title=International_Conference_on_Concurrency_Theory&oldid=1227641605 " C a t e g o r y : ● C o m p u t e r s c i e n c e c o n f e r e n c e s H i d d e n c a t e g o r i e s : ● A r t i c l e s l a c k i n g r e l i a b l e r e f e r e n c e s f r o m M a r c h 2 0 1 9 ● A l l a r t i c l e s l a c k i n g r e l i a b l e r e f e r e n c e s ● A r t i c l e s w i t h V I A F i d e n t i f i e r s ● A r t i c l e s w i t h G N D i d e n t i f i e r s ● A r t i c l e s w i t h L C C N i d e n t i f i e r s
● T h i s p a g e w a s l a s t e d i t e d o n 6 J u n e 2 0 2 4 , a t 2 3 : 5 8 ( U T C ) . ● T e x t i s a v a i l a b l e u n d e r t h e C r e a t i v e C o m m o n s A t t r i b u t i o n - S h a r e A l i k e L i c e n s e 4 . 0 ;
a d d i t i o n a l t e r m s m a y a p p l y . B y u s i n g t h i s s i t e , y o u a g r e e t o t h e T e r m s o f U s e a n d P r i v a c y P o l i c y . W i k i p e d i a ® i s a r e g i s t e r e d t r a d e m a r k o f t h e W i k i m e d i a F o u n d a t i o n , I n c . , a n o n - p r o f i t o r g a n i z a t i o n . ● P r i v a c y p o l i c y ● A b o u t W i k i p e d i a ● D i s c l a i m e r s ● C o n t a c t W i k i p e d i a ● C o d e o f C o n d u c t ● D e v e l o p e r s ● S t a t i s t i c s ● C o o k i e s t a t e m e n t ● M o b i l e v i e w
