Benedikt Bollig

2009
26	EE	Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl: Realizability of Concurrent Recursive Programs. FOSSACS 2009: 410-424
2008
25	EE	Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker: Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning. CONCUR 2008: 162-166
24	EE	S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar: Distributed Timed Automata with Independently Evolving Clocks. CONCUR 2008: 82-97
23	EE	Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl: Emptiness of Multi-pushdown Automata Is 2ETIME-Complete. Developments in Language Theory 2008: 121-133
22	EE	Benedikt Bollig: On the Expressive Power of 2-Stack Visibly Pushdown Automata CoRR abs/0812.2423: (2008)
21	EE	Benedikt Bollig, Dietrich Kuske: Muller message-passing automata and logics. Inf. Comput. 206(9-10): 1084-1094 (2008)
2007
20	EE	S. Akshay, Benedikt Bollig, Paul Gastin: Automata and Logics for Timed Message Sequence Charts. FSTTCS 2007: 290-302
19	EE	Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke: Propositional Dynamic Logic for Message-Passing Systems. FSTTCS 2007: 303-315
18	EE	Benedikt Bollig, Ingmar Meinecke: Weighted Distributed Systems and Their Logics. LFCS 2007: 54-68
17	EE	Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker: Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning. TACAS 2007: 435-450
2006
16		Benedikt Bollig: Formal Models of Communicating Systems - Languages, Automata, and Monadic Second-Order Logic Springer 2006
15	EE	Benedikt Bollig, Carsten Kern, Markus Schlütter, Volker Stolz: MSCan - A Tool for Analyzing MSC Specifications. TACAS 2006: 455-458
14	EE	Benedikt Bollig, Martin Leucker: Message-passing automata are expressively equivalent to EMSO logic. Theor. Comput. Sci. 358(2-3): 150-172 (2006)
2005
13	EE	Benedikt Bollig: On the Expressiveness of Asynchronous Cellular Automata. FCT 2005: 528-539
12	EE	Benedikt Bollig, Martin Leucker: A Hierarchy of Implementable MSC Languages. FORTE 2005: 53-67
2004
11	EE	Benedikt Bollig, Martin Leucker: Message-Passing Automata Are Expressively Equivalent to EMSO Logic. CONCUR 2004: 146-160
10		Christel Baier, Marcus Größer, Martin Leucker, Benedikt Bollig, Frank Ciesinski: Controller Synthesis for Probabilistic Systems. IFIP TCS 2004: 493-506
9	EE	Benedikt Bollig, Martin Leucker: Verifying Qualitative Properties of Probabilistic Programs. Validation of Stochastic Systems 2004: 124-146
2003
8	EE	Benedikt Bollig, Martin Leucker: Model Checking Probabilistic Distributed Systems. ASIAN 2003: 291-304
7		Benedikt Bollig, Martin Leucker: Deciding LTL over Mazurkiewicz traces. Data Knowl. Eng. 44(2): 219-238 (2003)
2002
6	EE	Benedikt Bollig, Martin Leucker, Thomas Noll: Generalised Regular MSC Languages. FoSSaCS 2002: 52-66
5	EE	Benedikt Bollig, Martin Leucker, Philipp Lucas: Extending Compositional Message Sequence Graphs. LPAR 2002: 68-85
4	EE	Benedikt Bollig, Martin Leucker, Michael Weber: Local Parallel Model Checking for the Alternation-Free µ-Calculus. SPIN 2002: 128-147
2001
3	EE	Benedikt Bollig, Martin Leucker, Michael Weber: Parallel Model Checking for the Alternation Free µ-Calculus. TACAS 2001: 543-558
2	EE	Benedikt Bollig, Martin Leucker: Deciding LTL over Mazurkiewicz Traces. TIME 2001: 189-197
1	EE	Benedikt Bollig, Martin Leucker: Modelling, Specifying, and Verifying Message Passing Systems. TIME 2001: 240-247

Coauthor Index

1	S. Akshay	[20] [24]
2	Mohamed Faouzi Atig	[23]
3	Christel Baier	[10]
4	Frank Ciesinski	[10]
5	Paul Gastin	[20] [24]
6	Manuela-Lidia Grindei	[26]
7	Marcus Größer	[10]
8	Peter Habermehl	[23] [26]
9	Joost-Pieter Katoen	[17] [25]
10	Carsten Kern	[15] [17] [25]
11	K. Narayan Kumar	[24]
12	Dietrich Kuske	[19] [21]
13	Martin Leucker	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [14] [17] [25]
14	Philipp Lucas	[5]
15	Ingmar Meinecke	[18] [19]
16	Madhavan Mukund	[24]
17	Thomas Noll	[6]
18	Markus Schlütter	[15]
19	Volker Stolz	[15]
20	Michael Weber	[3] [4]

Colors in the list of coauthors