@article{Bollig2006150,
    Author = {Bollig, Benedikt and Leucker, Martin},
    File = {Message-passing automata are expressively equivalent to EMSO logic - Bollig, Leucker (0) (0) - a - a - o.pdf},
    ISSN = {0304-3975},
    Journal = {Theoretical Computer Science},
    Keywords = {MSO and communicating automata},
    Note = {<ce:title>Concurrency Theory (CONCUR 2004)</ce:title> <xocs:full-name>15th International Conference on Concurrency Theory 2004</xocs:full-name>},
    Number = {2{\^a}€``3},
    Pages = {150 - 172},
    Title = {Message-passing automata are expressively equivalent to EMSO logic},
    URL = {http://www.sciencedirect.com/science/article/pii/S0304397506000508},
    Volume = {358},
    Year = {2006},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0304397506000508},
    bdsk-url-2 = {http://dx.doi.org/10.1016/j.tcs.2006.01.014},
    date-added = {2012-05-28 10:28:07 +0200},
    date-modified = {2012-05-28 08:28:34 +0000},
    doi = {10.1016/j.tcs.2006.01.014}
}

@article{Bollig2006150, Author = {Bollig, Benedikt and Leucker, Martin}, File = {Message-passing automata are expressively equivalent to EMSO logic - Bollig, Leucker (0) (0) - a - a - o.pdf}, ISSN = {0304-3975}, Journal = {Theoretical Computer Science}, Keywords = {MSO and communicating automata}, Note = {Concurrency Theory (CONCUR 2004) 15th International Conference on Concurrency Theory 2004}, Number = {2{\^a}€``3}, Pages = {150 - 172}, Title = {Message-passing automata are expressively equivalent to EMSO logic}, URL = {http://www.sciencedirect.com/science/article/pii/S0304397506000508}, Volume = {358}, Year = {2006}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0304397506000508}, bdsk-url-2 = {http://dx.doi.org/10.1016/j.tcs.2006.01.014}, date-added = {2012-05-28 10:28:07 +0200}, date-modified = {2012-05-28 08:28:34 +0000}, doi = {10.1016/j.tcs.2006.01.014} }