Publications : Benedikt BOLLIG

[BBB+20]
B. Bérard, B. Bollig, P. Bouyer, M. Függer, and N. Sznajder. Synthesis in Presence of Dynamic Links. In Proceedings of the 11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'20), Electronic Proceedings in Theoretical Computer Science, Brussels, Belgium, September 2020. To appear.
BibTex ]
[BFS20]
B. Bollig, A. Finkel, and A. Suresh. Bounded Reachability Problems are Decidable in FIFO Machines. In Proceedings of the 31st International Conference on Concurrency Theory (CONCUR'20), volume 171 of Leibniz International Proceedings in Informatics, Vienna, Austria, September 2020. Leibniz-Zentrum für Informatik. To appear.
BibTex ]
[BBLS20]
B. Bérard, B. Bollig, M. Lehaut, and N. Sznajder. Parameterized Synthesis for Fragments of First-Order Logic over Data Words. In Proceedings of the 23rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'20), Lecture Notes in Computer Science, pages 97--118, Dublin, Ireland, April 2020. Springer.
doi: 10.1007/978-3-030-45231-5_6.
BibTex | DOI ]
[BFG20]
B. Bollig, M. Fortin, and P. Gastin. Communicating Finite-State Machines, First-Order Logic, and Star-Free Propositional Dynamic Logic. Journal of Computer and System Sciences, 2020. To appear.
BibTex ]
[BBR19]
B. Bollig, P. Bouyer, and F. Reiter. Identifiers in Registers - Describing Network Algorithms with Logic. In Proceedings of the 22nd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'19), volume 11425 of Lecture Notes in Computer Science, pages 115--132, Prague, Czech Republic, April 2019. Springer.
doi: 10.1007/978-3-030-17127-8.
BibTex | DOI | Web page | PDF ]
[BQS19]
B. Bollig, K. Quaas, and A. Sangnier. The Complexity of Flat Freeze LTL. Logical Methods in Computer Science, 15(3):32:1--32:26, 2019.
doi: 10.23638/LMCS-15(3:32)2019.
BibTex | DOI | Web page | PDF ]
[BLS18]
B. Bollig, M. Lehaut, and N. Sznajder. Round-Bounded Control of Parameterized Systems. In Proceedings of the 16th International Symposium on Automated Technology for Verification and Analysis (ATVA'18), volume 11138 of Lecture Notes in Computer Science, pages 370--386, Los Angeles, California, USA, October 2018. Springer.
doi: 10.1007/978-3-030-01090-4_22.
BibTex | DOI | Web page ]
[BFG18b]
B. Bollig, M. Fortin, and P. Gastin. It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with ”Happened Before”. In Proceedings of the 29th International Conference on Concurrency Theory (CONCUR'18), volume 118 of Leibniz International Proceedings in Informatics, pages 7:1--7:17, Beijing, China, September 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2018.7.
BibTex | DOI | Web page | PDF ]
[ABG18]
C. Aiswarya, B. Bollig, and P. Gastin. An Automata-Theoretic Approach to the Verification of Distributed Algorithms. Information and Computation, 259:305--327, April 2018.
doi: 10.1016/j.ic.2017.05.006.
BibTex | DOI | PDF ]
[BFG18a]
B. Bollig, M. Fortin, and P. Gastin. Communicating Finite-State Machines and Two-Variable Logic. In Proceedings of the 35th Annual Symposium on Theoretical Aspects of Computer Science (STACS'18), volume 96 of Leibniz International Proceedings in Informatics, pages 17:1--17:14, Caen, France, February 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2018.17.
BibTex | DOI | Web page | PDF ]
[BGH18]
B. Bollig, M.-L. Grindei, and P. Habermehl. Realizability of Concurrent Recursive Programs. Formal Methods in System Design, 53(3):339--362, 2018.
doi: 10.1007/s10703-017-0282-y.
BibTex | DOI ]
[BQS17]
B. Bollig, K. Quaas, and A. Sangnier. The Complexity of Flat Freeze LTL. In Proceedings of the 28th International Conference on Concurrency Theory (CONCUR'17), volume 85 of Leibniz International Proceedings in Informatics, pages 33:1--33:16, Berlin, Germany, September 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2017.33.
BibTex | DOI | Web page | PDF ]
[BKM17]
B. Bollig, D. Kuske, and R. Mennicke. The Complexity of Model Checking Multi-Stack Systems. Theory of Computing Systems, 60(4):695--736, 2017.
doi: 10.1007/s00224-016-9700-6.
BibTex | DOI | Web page ]
[ABH17]
M. F. Atig, B. Bollig, and P. Habermehl. Emptiness of ordered multi-pushdown automata is 2ETIME-complete. International Journal of Foundations of Computer Science, 28(8):945--975, 2017.
doi: 10.1142/S0129054117500332.
BibTex | DOI | Web page | PDF ]
[Bol16]
B. Bollig. One-Counter Automata with Counter Observability. In Proceedings of the 36th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'16), volume 65 of Leibniz International Proceedings in Informatics, pages 20:1--20:14, Chennai, India, December 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2016.20.
BibTex | DOI | Web page ]
[Bol15c]
B. Bollig. Towards Formal Verification of Distributed Algorithms. In Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning (TIME'15), page 3, Kassel, Germany, September 2015. IEEE Computer Society Press.
doi: 10.1109/TIME.2015.23.
BibTex | DOI | Web page | PDF ]
[ABG15]
C. Aiswarya, B. Bollig, and P. Gastin. An Automata-Theoretic Approach to the Verification of Distributed Algorithms. In Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), volume 42 of Leibniz International Proceedings in Informatics, pages 340--353, Madrid, Spain, September 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2015.340.
BibTex | DOI | Web page | PDF ]
[Bol15a]
B. Bollig. Automata and Logics for Concurrent Systems: Five Models in Five Pages. In Proceedings of the 20th International Conference on Implementation and Application of Automata (CIAA'15), volume 9223 of Lecture Notes in Computer Science, pages 3--12, Umeå, Sweden, August 2015. Springer-Verlag.
doi: 10.1007/978-3-319-22360-5_1.
BibTex | DOI | Web page | PDF ]
[Bol15b]
B. Bollig. Automata and Logics for Concurrent Systems: Realizability and Verification. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, June 2015.
BibTex | Web page | PDF ]
[BHLM14]
B. Bollig, P. Habermehl, M. Leucker, and B. Monmege. A Robust Class of Data Languages and an Application to Learning. Logical Methods in Computer Science, 10(4:19), December 2014.
doi: 10.2168/LMCS-10(4:19)2014.
BibTex | DOI | Web page | PDF ]
[BGK14]
B. Bollig, P. Gastin, and A. Kumar. Parameterized Communicating Automata: Complementation and Model Checking. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), volume 29 of Leibniz International Proceedings in Informatics, pages 625--637, New Dehli, India, December 2014. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2014.625.
BibTex | DOI | Web page | PDF ]
[BCGZ14]
B. Bollig, A. Cyriac, P. Gastin, and M. Zeitoun. Temporal logics for concurrent recursive programs: Satisfiability and model checking. Journal of Applied Logic, 12(4):395--416, December 2014.
doi: 10.1016/j.jal.2014.05.001.
BibTex | DOI | Web page | PDF ]
[BGS14]
B. Bollig, P. Gastin, and J. Schubert. Parameterized Verification of Communicating Automata under Context Bounds. In Proceedings of the 8th Workshop on Reachability Problems in Computational Models (RP'14), volume 8762 of Lecture Notes in Computer Science, pages 45--57, Oxford, UK, September 2014. Springer.
doi: 10.1007/978-3-319-11439-2_4.
BibTex | DOI | Web page | PDF ]
[BGMZ14a]
B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. Logical Characterization of Weighted Pebble Walking Automata. In Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/ IEEE Symposium on Logic In Computer Science (CSL/LICS'14), Vienna, Austria, July 2014. ACM Press.
doi: 10.1145/2603088.2603118.
BibTex | DOI | Web page | PDF ]
[Bol14]
B. Bollig. Logic for Communicating Automata with Parameterized Topology. In Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/ IEEE Symposium on Logic In Computer Science (CSL/LICS'14), Vienna, Austria, July 2014. ACM Press.
doi: 10.1145/2603088.2603093.
BibTex | DOI | Web page | PDF ]
[ABG+14]
S. Akshay, B. Bollig, P. Gastin, M. Mukund, and K. Narayan Kumar. Distributed Timed Automata with Independently Evolving Clocks. Fundamenta Informaticae, 130(4):377--407, April 2014.
doi: 10.3233/FI-2014-996.
BibTex | DOI | Web page | PDF ]
[BGMZ14b]
B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. Pebble Weighted Automata and Weighted Logics. ACM Transactions on Computational Logic, 15(2:15), April 2014.
doi: 10.1145/2579819.
BibTex | DOI | Web page | PDF ]
[ABG13]
S. Akshay, B. Bollig, and P. Gastin. Event-clock Message Passing Automata: A Logical Characterization and an Emptiness-Checking Algorithm. Formal Methods in System Design, 42(3):262--300, June 2013.
doi: 10.1007/s10703-012-0179-8.
BibTex | DOI | Web page | PDF ]
[BKM13]
B. Bollig, D. Kuske, and R. Mennicke. The Complexity of Model Checking Multi-Stack Systems. In Proceedings of the 28th Annual IEEE Symposium on Logic in Computer Science (LICS'13), pages 163--170, New-Orleans, Louisiana, USA, June 2013. IEEE Computer Society Press.
doi: 10.1109/LICS.2013.22.
BibTex | DOI | Web page | PDF ]
[BHLM13]
B. Bollig, P. Habermehl, M. Leucker, and B. Monmege. A Fresh Approach to Learning Register Automata. In Proceedings of the 17th International Conference on Developments in Language Theory (DLT'13), volume 7907 of Lecture Notes in Computer Science, pages 118--130, Marne-la-Vallée, France, June 2013. Springer.
doi: 10.1007/978-3-642-38771-5_12.
BibTex | DOI | Web page | PDF ]
[BCH+13]
B. Bollig, A. Cyriac, L. Hélouët, A. Kara, and Th. Schwentick. Dynamic Communicating Automata and Branching High-Level MSCs. In Proceedings of the 7th International Conference on Language and Automata Theory and Applications (LATA'13), volume 7810 of Lecture Notes in Computer Science, pages 177--189, Bilbao, Spain, April 2013. Springer.
doi: 10.1109/REVET.2012.6195253.
BibTex | DOI | Web page | PDF ]
[BGM13]
B. Bollig, P. Gastin, and B. Monmege. Weighted Specifications over Nested Words. In Proceedings of the 16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'13), volume 7794 of Lecture Notes in Computer Science, pages 385--400, Rome, Italy, March 2013. Springer.
doi: 10.1007/978-3-642-37075-5_25.
BibTex | DOI | Web page | PDF ]
[BGMZ12]
B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. A Probabilistic Kleene Theorem. In Proceedings of the 10th International Symposium on Automated Technology for Verification and Analysis (ATVA'12), volume 7561 of Lecture Notes in Computer Science, pages 400--415, Thiruvananthapuram, India, October 2012. Springer.
doi: 10.1007/978-3-642-33386-6_31.
BibTex | DOI | Web page | PDF ]
[BDL12]
B. Bollig, N. Decker, and M. Leucker. Frequency Linear-time Temporal Logic. In Proceedings of the 6th International Symposium on Theoretical Aspects of Software Engineering (TASE'12), pages 85--92, Beijing, China, July 2012. IEEE Computer Society Press.
doi: 10.1109/TASE.2012.43.
BibTex | DOI | Web page | PDF ]
[BK12]
B. Bollig and D. Kuske. An optimal construction of Hanf sentences. Journal of Applied Logic, 10(2):179--186, June 2012.
doi: 10.1016/j.jal.2012.01.002.
BibTex | DOI | Web page | PDF ]
[BCGNK12]
B. Bollig, A. Cyriac, P. Gastin, and K. Narayan Kumar. Model Checking Languages of Data Words. In Proceedings of the 15th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'12), volume 7213 of Lecture Notes in Computer Science, pages 391--405, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28729-9_26.
BibTex | DOI | Web page | PDF ]
[Bol11]
B. Bollig. An automaton over data words that captures EMSO logic. In Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR'11), volume 6901 of Lecture Notes in Computer Science, pages 171--186, Aachen, Germany, September 2011. Springer.
doi: 10.1007/978-3-642-23217-6_12.
BibTex | DOI | Web page | PDF ]
[BCGZ11]
B. Bollig, A. Cyriac, P. Gastin, and M. Zeitoun. Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11), volume 6907 of Lecture Notes in Computer Science, pages 132--144, Warsaw, Poland, August 2011. Springer.
doi: 10.1007/978-3-642-22993-0_15.
BibTex | DOI | Web page | PDF ]
[BGMZ11]
B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. Weighted Expressions and DFS Tree Automata. Research Report LSV-11-08, Laboratoire Spécification et Vérification, ENS Cachan, France, April 2011. 32 pages.
BibTex | Web page | PDF ]
[BKKL11]
B. Bollig, J.-P. Katoen, C. Kern, and M. Leucker. SMA---The Smyle Modeling Approach. In Revised Selected Papars of the 3rd IFIP TC2 Central and East European Conference on Software Engineering Techniques (CEE-SET'08), volume 4980 of Lecture Notes in Computer Science, pages 103--117, Brno, Czech Republic, 2011. Springer.
doi: 10.1007/978-3-642-22386-0_8.
BibTex | DOI | Web page | PDF ]
[BKM10]
B. Bollig, D. Kuske, and I. Meinecke. Propositional Dynamic Logic for Message-Passing Systems. Logical Methods in Computer Science, 6(3:16), September 2010.
doi: 10.2168/LMCS-6(3:16)2010.
BibTex | DOI | Web page | PDF ]
[BGMZ10]
B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. Pebble weighted automata and transitive closure logics. In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10) -- Part II, volume 6199 of Lecture Notes in Computer Science, pages 587--598, Bordeaux, France, July 2010. Springer.
doi: 10.1007/978-3-642-14162-1_49.
BibTex | DOI | Web page | PDF ]
[BKK+10]
B. Bollig, J.-P. Katoen, C. Kern, M. Leucker, D. Neider, and D. R. Piegdon. libalf: the Automata Learning Framework. In Proceedings of the 22nd International Conference on Computer Aided Verification (CAV'10), volume 6174 of Lecture Notes in Computer Science, pages 360--364, Edinburgh, Scotland, UK, July 2010. Springer.
doi: 10.1007/978-3-642-14295-6_32.
BibTex | DOI | Web page | PDF ]
[BH10]
B. Bollig and L. Hélouët. Realizability of Dynamic MSC Languages. In Proceedings of the 5th International Computer Science Symposium in Russia (CSR'10), volume 6072 of Lecture Notes in Computer Science, pages 48--59, Kazan, Russia, June 2010. Springer.
doi: 10.1007/978-3-642-13182-0_5.
BibTex | DOI | Web page | PDF ]
[BKKL10a]
B. Bollig, J.-P. Katoen, C. Kern, and M. Leucker. Learning Communicating Automata from MSCs. IEEE Transactions on Software Engineering, 36(3):390--408, May-June 2010.
doi: 10.1109/TSE.2009.89.
BibTex | DOI | Web page | PDF ]
[BKKL10b]
B. Bollig, J.-P. Katoen, C. Kern, and M. Leucker. SMA---The Smyle Modeling Approach. Computing and Informatics, 29(1):45--72, 2010.
BibTex | Web page | PDF ]
[BHKL09]
B. Bollig, P. Habermehl, C. Kern, and M. Leucker. Angluin-Style Learning of NFA. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI'09), pages 1004--1009, Pasadena, California, USA, July 2009. AAAI Press.
BibTex | Web page | PDF ]
[BG09]
B. Bollig and P. Gastin. Weighted versus Probabilistic Logics. In Proceedings of the 13th International Conference on Developments in Language Theory (DLT'09), volume 5583 of Lecture Notes in Computer Science, pages 18--38, Stuttgart, Germany, June-July 2009. Springer.
doi: 10.1007/978-3-642-02737-6_2.
BibTex | DOI | Web page | PDF ]
[BGH09]
B. Bollig, M.-L. Grindei, and P. Habermehl. Realizability of Concurrent Recursive Programs. In Proceedings of the 12th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'09), volume 5504 of Lecture Notes in Computer Science, pages 410--424, York, UK, March 2009. Springer.
doi: 10.1007/978-3-642-00596-1_29.
BibTex | DOI | Web page | PDF ]
[Bol08]
B. Bollig. On the Expressive Power of 2-Stack Visibly Pushdown Automata. Logical Methods in Computer Science, 4(4:16), December 2008.
doi: 10.2168/LMCS-4(4:16)2008.
BibTex | DOI | Web page | PS | PDF ]
[BBC+08]
B. Bollig, P. Bouyer, F. Cassez, Th. Chatain, P. Gastin, S. Haddad, and C. Jard. Model for distributed timed systems. Deliverable DOTS 3.1 (ANR-06-SETI-003), September 2008.
BibTex ]
[ABH08]
M. F. Atig, B. Bollig, and P. Habermehl. Emptiness of multi-pushdown automata is 2ETIME-complete. In Proceedings of the 12th International Conference on Developments in Language Theory (DLT'08), volume 5257 of Lecture Notes in Computer Science, pages 121--133, Kyoto, Japan, September 2008. Springer.
doi: 10.1007/978-3-540-85780-8_9.
BibTex | DOI | Web page | PDF ]
[BK08]
B. Bollig and D. Kuske. Muller Message-Passing Automata and Logics. Information and Computation, 206(9-10):1084--1094, September-October 2008.
doi: 10.1016/j.ic.2008.03.010.
BibTex | DOI | Web page | PS | PDF ]
[BKKL08]
B. Bollig, J.-P. Katoen, C. Kern, and M. Leucker. Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning. In Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08), volume 5201 of Lecture Notes in Computer Science, pages 162--166, Toronto, Canada, August 2008. Springer.
doi: 10.1007/978-3-540-85361-9_15.
BibTex | DOI | Web page | PDF ]
[ABG+08]
S. Akshay, B. Bollig, P. Gastin, M. Mukund, and K. Narayan Kumar. Distributed Timed Automata with Independently Evolving Clocks. In Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08), volume 5201 of Lecture Notes in Computer Science, pages 82--97, Toronto, Canada, August 2008. Springer.
doi: 10.1007/978-3-540-85361-9_10.
BibTex | DOI | Web page | PDF ]
[ABG07]
S. Akshay, B. Bollig, and P. Gastin. Automata and Logics for Timed Message Sequence Charts. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), volume 4855 of Lecture Notes in Computer Science, pages 290--302, New Delhi, India, December 2007. Springer.
doi: 10.1007/978-3-540-77050-3_24.
BibTex | DOI | Web page | PS | PDF ]
[BKM07]
B. Bollig, D. Kuske, and I. Meinecke. Propositional Dynamic Logic for Message-Passing Systems. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), volume 4855 of Lecture Notes in Computer Science, pages 303--315, New Delhi, India, December 2007. Springer.
doi: 10.1007/978-3-540-77050-3_25.
BibTex | DOI | Web page | PS | PDF ]
[BM07]
B. Bollig and I. Meinecke. Weighted Distributed Systems and Their Logics. In Proceedings of the Symposium on Logical Foundations of Computer Science (LFCS'07), volume 4514 of Lecture Notes in Computer Science, pages 54--68, New York, New York, USA, June 2007. Springer.
doi: 10.1007/978-3-540-72734-7_5.
BibTex | DOI | Web page | PS | PDF ]
[BK07]
B. Bollig and D. Kuske. Muller Message-Passing Automata and Logics. In Preliminary Proceedings of the 1st International Conference on Language and Automata Theory and Applications (LATA'07), Tarragona, Spain, March-April 2007.
BibTex | Web page | PS | PDF ]
[BKKL07]
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 Proceedings of the 13th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'07), volume 4424 of Lecture Notes in Computer Science, pages 435--450, Braga, Portugal, March 2007. Springer.
doi: 10.1007/978-3-540-71209-1_33.
BibTex | DOI | Web page | PS | PDF ]
[BL06]
B. Bollig and M. Leucker. Message-Passing Automata are Expressively Equivalent to EMSO Logic. Theoretical Computer Science, 358(2-3):150--172, August 2006.
doi: 10.1016/j.tcs.2006.01.014.
BibTex | DOI | Web page | PS | PDF ]
[Bol06]
B. Bollig. Formal Models of Communicating Systems --- Languages, Automata, and Monadic Second-Order Logic. Springer, June 2006.
BibTex | Web page ]
[BK06]
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.
BibTex | Web page | PS | PDF ]
[BKSS06]
B. Bollig, C. Kern, M. Schlütter, and V. Stolz. MSCan: A Tool for Analyzing MSC Specifications. In Proceedings of the 12th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'06), volume 3920 of Lecture Notes in Computer Science, pages 455--458, Vienna, Austria, March 2006. Springer.
doi: 10.1007/11691372_32.
BibTex | DOI | Web page | PS | PDF ]
[BL05]
B. Bollig and M. Leucker. A Hierarchy of Implementable MSC Languages. In Proceedings of 25th IFIP WG6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE'05), volume 3731 of Lecture Notes in Computer Science, pages 53--67, Taipei, Taiwan, October 2005. Springer.
doi: 10.1007/11562436_6.
BibTex | DOI | Web page | PS | PDF ]
[Bol05b]
B. Bollig. On the Expressiveness of Asynchronous Cellular Automata. In Proceedings of the 15th International Symposium on Fundamentals of Computation Theory (FCT'05), volume 3623 of Lecture Notes in Computer Science, pages 528--539, Lübeck, Germany, August 2005. Springer.
doi: 10.1007/11537311_23.
BibTex | DOI | Web page | PS | PDF ]
[Bol05a]
B. Bollig. Automata and Logics for Message Sequence Charts. Thèse de doctorat, Department of Computer Science, RWTH Aachen, Germany, May 2005.
BibTex | Web page | PS | PDF ]
[BGL+04]
C. Baier, M. Größer, M. Leucker, B. Bollig, and F. Ciesinski. Probabilistic controller synthesis. In Proceedings of the 3rd IFIP International Conference on Theoretical Computer Science (IFIP TCS'04), IFIP Conference Proceedings, pages 493--506, Toulouse, France, August 2004. Kluwer Academic Publishers.
BibTex | Web page | PDF ]
[BL04a]
B. Bollig and M. Leucker. Message-Passing Automata are Expressively Equivalent to EMSO Logic. In Proceedings of the 15th International Conference on Concurrency Theory (CONCUR'04), volume 3170 of Lecture Notes in Computer Science, pages 146--160, London, UK, August 2004. Springer.
doi: 10.1007/978-3-540-28644-8_10.
BibTex | DOI | Web page | PS | PDF ]
[BL04b]
B. Bollig and M. Leucker. Verifying Qualitative Properties of Probabilistic Programs. In Validation of Stochastic Systems: A Guide to Current Research, volume 2925 of Lecture Notes in Computer Science, pages 124--146. Springer, 2004.
BibTex | Web page | PDF ]
[BL03b]
B. Bollig and M. Leucker. Model Checking Probabilistic Distributed Systems. In Proceedings of the 8th Asian Computing Science Conference (ASIAN'03), volume 2896 of Lecture Notes in Computer Science, pages 291--304, Mumbai, India, December 2003. Springer.
BibTex | Web page | PS | PDF ]
[BL03a]
B. Bollig and M. Leucker. Deciding LTL over Mazurkiewicz Traces. Data & Knowledge Engineering, 44(2):221--240, February 2003.
doi: 10.1016/S0169-023X(02)00136-2.
BibTex | DOI | Web page | PS ]
[BLL02]
B. Bollig, M. Leucker, and Ph. Lucas. Extending Compositional Message Sequence Graphs. In Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'02), volume 2514 of Lecture Notes in Artificial Intelligence, pages 68--85, Tbilisi, Georgia, October 2002. Springer.
BibTex | Web page | PS ]
[BLW02]
B. Bollig, M. Leucker, and M. Weber. Local Parallel Model Checking for the Alternation-Free μ-Calculus. In Proceedings of the 9th International SPIN Workshop on Model Checking Software (SPIN'02), volume 2318 of Lecture Notes in Computer Science, pages 128--147, Grenoble, France, April 2002. Springer.
BibTex | Web page | PDF ]
[BLN02]
B. Bollig, M. Leucker, and T. Noll. Generalised Regular MSC Languages. In Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'02), volume 2303 of Lecture Notes in Computer Science, pages 52--66, Grenoble, France, April 2002. Springer.
BibTex | Web page | PS ]
[BL01b]
B. Bollig and M. Leucker. Modelling, Specifying, and Verifying Message Passing Systems. In Proceedings of the 8th International Symposium on Temporal Representation and Reasoning (TIME'01), pages 240--247, Cividale del Friuli, Italy, June 2001. IEEE Computer Society Press.
BibTex | Web page | PS ]
[BL01a]
B. Bollig and M. Leucker. Deciding LTL over Mazurkiewicz Traces. In Proceedings of the 8th International Symposium on Temporal Representation and Reasoning (TIME'01), pages 189--197, Cividale del Friuli, Italy, June 2001. IEEE Computer Society Press.
BibTex | Web page | PS ]
[BLW01]
B. Bollig, M. Leucker, and M. Weber. Parallel Model Checking for the Alternation Free Mu-Calculus. In Proceedings of the 7th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'01), volume 2031 of Lecture Notes in Computer Science, pages 543--558, Genova, Italy, April 2001. Springer.
BibTex ]

This file was generated by bibtex2html 1.98.

About LSV