2010 |
|
• |
B. Bollig, J.-P. Katoen, C. Kern and M. Leucker. Learning Communicating Automata from MSCs. IEEE Transactions on Software Engineering, 2010. To appear. ( PDF | BibTeX + Abstract )
|
|
• |
B. Bollig, J.-P. Katoen, C. Kern and M. Leucker. SMA-The Smyle Modeling Approach. Computing and Informatics, 2010. To appear. ( PDF | BibTeX + Abstract )
|
|
• |
B. Bollig and L. Hélouët. Realizability of Dynamic MSC Languages. In CSR'10, LNCS. Springer, 2010. To appear. ( BibTeX )
|
|
• |
B. Bollig, P. Gastin, B. Monmège and M. Zeitoun. Pebble weighted automata and transitive closure logics. Research Report LSV-10-06, Laboratoire Spécification et Vérification, ENS Cachan,
France, March 2010. 20 pages. ( PDF | BibTeX + Abstract )
|
2009 |
|
• |
B. Bollig, J.-P. Katoen, C. Kern and M. Leucker. SMA-The Smyle Modeling Approach. In CEE-SET'08, LNCS. Springer, 2009. To appear. ( PDF (long version) | BibTeX + Abstract )
|
|
• |
B. Bollig, P. Habermehl, C. Kern and M. Leucker. Angluin-Style Learning of NFA. In IJCAI'09, pages 1004-1009. AAAI Press, 2009. ( PDF | PDF (long version) | BibTeX + Abstract )
|
|
• |
B. Bollig and P. Gastin. Weighted versus Probabilistic Logics. In DLT'09, LNCS 5583, pages 18-38. Springer, 2009. ( PDF | BibTeX + Abstract )
|
|
• |
B. Bollig, M.-L. Grindei and P. Habermehl. Realizability of Concurrent Recursive Programs. In FoSSaCS'09, LNCS 5504, pages 410-424. Springer, 2009. ( PDF | BibTeX + Abstract )
|
2008 |
|
• |
B. Bollig. On the Expressive Power of 2-Stack Visibly Pushdown Automata. Logical Methods in Computer Science 4(4:16), 2008. ( PDF | PS | PS.GZ | BibTeX + Abstract )
|
|
• |
M. F. Atig, B. Bollig and P. Habermehl. Emptiness of multi-pushdown automata is 2ETIME-complete. In DLT'08, LNCS 5257, pages 121-133. Springer, 2008. ( PDF | BibTeX + Abstract )
|
|
• |
B. Bollig and D. Kuske. Muller Message-Passing Automata and Logics. Information and Computation 206(9-10), pages 1084-1094, 2008. ( PDF | PS | PS.GZ | BibTeX + Abstract )
|
|
• |
S. Akshay, B. Bollig, P. Gastin, M. Mukund and K. Narayan Kumar. Distributed Timed Automata with Independently Evolving Clocks. In CONCUR'08, LNCS 5201, pages 82-97. Springer, 2008. ( PDF | BibTeX + Abstract )
|
|
• |
B. Bollig, J.-P. Katoen, C. Kern and M. Leucker. Smyle: A Tool for Synthesizing Distributed Models from
Scenarios by Learning. In CONCUR'08, LNCS 5201, pages 162-166. Springer, 2008. ( PDF | BibTeX )
|
2007 |
|
• |
S. Akshay, B. Bollig and P. Gastin. Automata and Logics for Timed Message Sequence Charts. In FSTTCS'07, LNCS 4855, pages 290-302. Springer, 2007. ( PDF | PS | PS.GZ | BibTeX + Abstract )
|
|
• |
B. Bollig, D. Kuske and I. Meinecke. Propositional Dynamic Logic for Message-Passing Systems. In FSTTCS'07, LNCS 4855, pages 303-315. Springer, 2007. ( PDF | PS | PS.GZ | PDF (long version) | BibTeX + Abstract )
|
|
• |
B. Bollig and I. Meinecke. Weighted Distributed Systems and Their Logics. In LFCS'07, LNCS 4514, pages 54-68. Springer, 2007. ( PDF | PS | PS.GZ | BibTeX + Abstract )
|
|
• |
B. Bollig, J.-P. Katoen, C. Kern and M. Leucker. Replaying Play in and Play out: Synthesis of Design Models from
Scenarios by Learning. In TACAS'07, LNCS 4424, pages 435-450. Springer, 2007. ( PDF | PS | PS.GZ | BibTeX + Abstract )
|
|
• |
B. Bollig and D. Kuske. Muller Message-Passing Automata and Logics. In LATA'07. 2007. ( PDF | PS | PS.GZ | BibTeX + Abstract )
|
2006 |
|
• |
B. Bollig and M. Leucker. Message-Passing Automata are Expressively Equivalent to EMSO Logic. Theoretical Computer Science 358(2-3), pages 150-172, 2006. ( PDF | PS | PS.GZ | BibTeX + Abstract )
|
|
• |
B. Bollig. Formal Models of Communicating Systems - Languages, Automata, and
Monadic Second-Order Logic. Springer, 2006. ( Web page | BibTeX + Abstract )
|
|
• |
B. Bollig and D. Kuske. Distributed Muller Automata and Logics. Research Report LSV-06-11, Laboratoire Spécification et Vérification, ENS Cachan,
France, May 2006. 23 pages. ( PDF | PS | PS.GZ | BibTeX + Abstract )
|
|
• |
B. Bollig, C. Kern, M. Schlütter and V. Stolz. MSCan: A Tool for Analyzing MSC Specifications. In TACAS'06, LNCS 3920, pages 455-458. Springer, 2006. ( PDF | PS | PS.GZ | BibTeX + Abstract )
|
2005 |
|
• |
B. Bollig and M. Leucker. A Hierarchy of Implementable MSC Languages. In FORTE'05, LNCS 3731, pages 53-67. Springer, 2005. ( PDF | PS | PS.GZ | BibTeX + Abstract )
|
|
• |
B. Bollig. On the Expressiveness of Asynchronous Cellular Automata. In FCT'05, LNCS 3623, pages 528-539. Springer, 2005. ( PDF | PS | PS.GZ | BibTeX + Abstract )
|
|
• |
B. Bollig. Automata and Logics for Message Sequence Charts. Thèse de doctorat, Department of Computer Science, RWTH Aachen, Germany, May 2005. ( PDF | PS | PS.GZ | BibTeX )
|
2004 |
|
• |
B. Bollig and M. Leucker. Verifying Qualitative Properties of Probabilistic Programs. In Validation of Stochastic Systems, LNCS 2925, pages 124-146. Springer, 2004. ( PDF | BibTeX + Abstract )
|
|
• |
C. Baier, M. Größer, M. Leucker, B. Bollig and F. Ciesinski. Probabilistic controller synthesis. In IFIP TCS'04, IFIP Conference Proceedings, pages 493-506. Kluwer Academic Publishers, 2004. ( PDF | BibTeX + Abstract )
|
|
• |
B. Bollig and M. Leucker. Message-Passing Automata are Expressively Equivalent to EMSO Logic. In CONCUR'04, LNCS 3170, pages 146-160. Springer, 2004. ( PDF | PS | PS.GZ | BibTeX + Abstract )
|
2003 |
|
• |
B. Bollig and M. Leucker. Model Checking Probabilistic Distributed Systems. In ASIAN'03, LNCS 2896, pages 291-304. Springer, 2003. ( PDF | PS | PS.GZ | BibTeX + Abstract )
|
|
• |
B. Bollig and M. Leucker. Deciding LTL over Mazurkiewicz Traces. Data & Knowledge Engineering 44(2), pages 221-240, 2003. ( PS | PS.GZ | BibTeX + Abstract )
|
2002 |
|
• |
B. Bollig, M. Leucker and Ph. Lucas. Extending Compositional Message Sequence Graphs. In LPAR'02, LNAI 2514, pages 68-85. Springer, 2002. ( PS | PS.GZ | BibTeX + Abstract )
|
|
• |
B. Bollig, M. Leucker and T. Noll. Generalised Regular MSC Languages. In FoSSaCS'02, LNCS 2303, pages 52-66. Springer, 2002. ( PS | PS.GZ | BibTeX + Abstract )
|
|
• |
B. Bollig, M. Leucker and M. Weber. Local Parallel Model Checking for the Alternation-Free
μ-Calculus. In SPIN'02, LNCS 2318, pages 128-147. Springer, 2002. ( PDF | PS (long version) | PS.GZ (long version) | BibTeX )
|
2001 |
|
• |
B. Bollig and M. Leucker. Modelling, Specifying, and Verifying Message Passing Systems. In TIME'01, pages 240-247. IEEE Computer Society Press, 2001. ( PS | PS.GZ | BibTeX + Abstract )
|
|
• |
B. Bollig and M. Leucker. Deciding LTL over Mazurkiewicz Traces. In TIME'01, pages 189-197. IEEE Computer Society Press, 2001. ( PS | PS.GZ | BibTeX + Abstract )
|
|
• |
B. Bollig, M. Leucker and M. Weber. Parallel Model Checking for the Alternation Free Mu-Calculus. In TACAS'01, LNCS 2031, pages 543-558. Springer, 2001. ( BibTeX + Abstract )
|