Conferences in DBLP

International Conference on Concurrency Theory (CONCUR) (concur)
2006 (conf/concur/2006)

1. Xiaojun Liu, Eleftherios Matsikoudis, Edward A. Lee
   Modeling Timed Concurrent Systems. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2006, pp:1-15 [Conf]
   
2. Clemens Grabmayer, Jan Willem Klop, Bas Luttik
   Some Remarks on Definability of Process Graphs. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2006, pp:16-36 [Conf]
   
3. Orna Kupferman
   Sanity Checks in Formal Verification. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2006, pp:37-51 [Conf]
   
4. Uwe Nestmann
   Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2006, pp:52-63 [Conf]
   
5. Roberto Segala
   Probability and Nondeterminism in Operational Models of Concurrency. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2006, pp:64-78 [Conf]
   
6. Stefan Leue, Alin Stefanescu, Wei Wei
   A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2006, pp:79-94 [Conf]
   
7. Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, Mayank Saksena
   Proving Liveness by Backwards Reachability. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2006, pp:95-109 [Conf]
   
8. Arend Rensink
   Model Checking Quantified Computation Tree Logic. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2006, pp:110-125 [Conf]
   
9. Rob J. van Glabbeek, Marc Voorhoeve
   Liveness, Fairness and Impossible Futures. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2006, pp:126-141 [Conf]
   
10. Flavio Corradini, Maria Rita Di Berardini, Walter Vogler
    Checking a Mutex Algorithm in a Process Algebra with Fairness. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:142-157 [Conf]
    
11. Yoshinao Isobe, Markus Roggenbach
    A Complete Axiomatic Semantics for the CSP Stable-Failures Model. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:158-172 [Conf]
    
12. Maciej Koutny, Marta Pietkiewicz-Koutny
    Transition Systems of Elementary Net Systems with Localities. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:173-187 [Conf]
    
13. Henri Hansen, Antti Valmari
    Operational Determinism and Fast Algorithms. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:188-202 [Conf]
    
14. Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
    Minimization, Learning, and Conformance Testing of Boolean Programs. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:203-217 [Conf]
    
15. Tachio Terauchi, Alex Aiken
    A Capability Calculus for Concurrency and Determinism. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:218-232 [Conf]
    
16. Naoki Kobayashi
    A New Type System for Deadlock-Free Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:233-247 [Conf]
    
17. Lars Birkedal, Søren Debois, Thomas Hildebrandt
    Sortings for Reactive Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:248-262 [Conf]
    
18. Avik Chaudhuri
    Dynamic Access Control in a Concurrent Object Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:263-278 [Conf]
    
19. Paolo Baldan, Fabio Gadducci, Ugo Montanari
    Concurrent Rewriting for Graphs with Equivalences. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:279-294 [Conf]
    
20. Roberto Bruni, Hernán C. Melgratti, Ugo Montanari
    Event Structure Semantics for Nominal Calculi. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:295-309 [Conf]
    
21. Giuseppe Castagna, Mariangiola Dezani-Ciancaglini, Daniele Varacca
    Encoding CDuce in the Cpi-Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:310-326 [Conf]
    
22. Suzana Andova, Jos C. M. Baeten, Tim A. C. Willemse
    A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:327-342 [Conf]
    
23. Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
    Probabilistic I/O Automata: Theories of Two Equivalences. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:343-357 [Conf]
    
24. Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera
    Reachability in Recursive Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:358-374 [Conf]
    
25. Krishnendu Chatterjee, Thomas A. Henzinger
    Strategy Improvement for Stochastic Rabin and Streett Games. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:375-389 [Conf]
    
26. Damien Pous
    Weak Bisimulation Up to Elaboration. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:390-405 [Conf]
    
27. Ichiro Hasuo
    Generic Forward and Backward Simulations. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:406-420 [Conf]
    
28. Taolue Chen, Wan Fokkink
    On Finite Alphabets and Infinite Bases III: Simulation. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:421-434 [Conf]
    
29. Olga Grinchtein, Bengt Jonsson, Paul Pettersson
    Inference of Event-Recording Automata Using Timed Decision Trees. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:435-449 [Conf]
    
30. Patricia Bouyer, Laura Bozzelli, Fabrice Chevalier
    Controller Synthesis for MTL Specifications. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:450-464 [Conf]
    
31. Ramzi Ben Salah, Marius Bozga, Oded Maler
    On Interleaving in Timed Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:465-476 [Conf]
    
32. David Kitchin, William R. Cook, Jayadev Misra
    A Language for Task Orchestration and Its Semantic Properties. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:477-491 [Conf]
    
33. Orna Kupferman, Sarai Sheinvald-Faragy
    Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:492-508 [Conf]
    
34. Colin Stirling
    Second-Order Simple Grammars. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:509-523 [Conf]