@chapter{BolligLeucker,
    Author = {Bollig, Benedikt and Leucker, Martin},
    BookTitle = {CONCUR 2004 - Concurrency Theory},
    File = {Message-Passing Automata Are Expressively Equivalent to EMSO Logic - Bollig, Leucker (0) (1) - a - a - o.pdf},
    Keywords = {MSO and communicating automata},
    Pages = {146--160},
    Series = {Lecture Notes in Computer Science},
    Title = {Message-Passing Automata Are Expressively Equivalent to EMSO Logic},
    Volume = {3170},
    Year = {2004},
    bdsk-url-1 = {http://www.springerlink.com/content/ky46aldy1v0hngtg/fulltext.pdf},
    bdsk-url-2 = {http://dx.doi.org/10.1007/978-3-540-28644-8\_10},
    date-added = {2012-05-28 10:27:37 +0200},
    date-modified = {2012-05-28 09:09:45 +0000},
    doi = {10.1007/978-3-540-28644-8_10}
}

@chapter{BolligLeucker, Author = {Bollig, Benedikt and Leucker, Martin}, BookTitle = {CONCUR 2004 - Concurrency Theory}, File = {Message-Passing Automata Are Expressively Equivalent to EMSO Logic - Bollig, Leucker (0) (1) - a - a - o.pdf}, Keywords = {MSO and communicating automata}, Pages = {146--160}, Series = {Lecture Notes in Computer Science}, Title = {Message-Passing Automata Are Expressively Equivalent to EMSO Logic}, Volume = {3170}, Year = {2004}, bdsk-url-1 = {http://www.springerlink.com/content/ky46aldy1v0hngtg/fulltext.pdf}, bdsk-url-2 = {http://dx.doi.org/10.1007/978-3-540-28644-8_10}, date-added = {2012-05-28 10:27:37 +0200}, date-modified = {2012-05-28 09:09:45 +0000}, doi = {10.1007/978-3-540-28644-8_10} }