@inproceedings{gller_et_al:LIPIcs:2012:3421,
Address = {Dagstuhl, Germany},
Annote = {Keywords: Modal Logic, Model Checking, Asynchronous Product, Pushdown Systems, Feferman-Vaught, Nonelementary lower bounds},
Author = {G{\"o}ller, Stefan and Lin, Anthony Widjaja},
BookTitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
Editor = {D{\"u}rr, Christoph and Wilke, Thomas},
File = {Concurrency Makes Simple Theories Hard - Göller, Lin (0) (0) - a - a - a.pdf},
ISBN = {978-3-939897-35-4},
ISSN = {1868-8969},
Pages = {148--159},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{Concurrency Makes Simple Theories Hard}},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3421},
Volume = {14},
Year = {2012},
bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2012/3421},
bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.STACS.2012.148},
date-added = {2013-11-30 16:48:14 +0000},
date-modified = {2013-11-30 16:48:14 +0000},
urn = {urn:nbn:de:0030-drops-34214},
doi = {10.4230/LIPIcs.STACS.2012.148}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A