 | 2012 |
| 44 |  | Benedikt Bollig,
Aiswarya Cyriac,
Paul Gastin,
K. Narayan Kumar:
Model Checking Languages of Data Words.
FoSSaCS 2012: 391-405 |
| 43 |  | Benedikt Bollig,
Dietrich Kuske:
An optimal construction of Hanf sentences.
J. Applied Logic 10(2): 179-186 (2012) |
| 2011 |
| 42 |  | Benedikt Bollig:
An Automaton over Data Words That Captures EMSO Logic.
CONCUR 2011: 171-186 |
| 41 |  | Benedikt Bollig,
Aiswarya Cyriac,
Paul Gastin,
Marc Zeitoun:
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking.
MFCS 2011: 132-144 |
| 40 |  | Benedikt Bollig:
An automaton over data words that captures EMSO logic
CoRR abs/1101.4475: (2011) |
| 39 |  | Benedikt Bollig,
Dietrich Kuske:
An optimal construction of Hanf sentences
CoRR abs/1105.5487: (2011) |
| 2010 |
| 38 |  | Benedikt Bollig,
Joost-Pieter Katoen,
Carsten Kern,
Martin Leucker,
Daniel Neider,
David R. Piegdon:
libalf: The Automata Learning Framework.
CAV 2010: 360-364 |
| 37 |  | Benedikt Bollig,
Loïc Hélouët:
Realizability of Dynamic MSC Languages.
CSR 2010: 48-59 |
| 36 |  | Benedikt Bollig,
Paul Gastin,
Benjamin Monmege,
Marc Zeitoun:
Pebble Weighted Automata and Transitive Closure Logics.
ICALP (2) 2010: 587-598 |
| 35 |  | Benedikt Bollig,
Joost-Pieter Katoen,
Carsten Kern,
Martin Leucker:
SMA - The Smyle Modeling Approach.
Computing and Informatics 29(1): 45-72 (2010) |
| 34 |  | Benedikt Bollig,
Joost-Pieter Katoen,
Carsten Kern,
Martin Leucker:
Learning Communicating Automata from MSCs.
IEEE Trans. Software Eng. 36(3): 390-408 (2010) |
| 33 |  | Benedikt Bollig,
Dietrich Kuske,
Ingmar Meinecke:
Propositional Dynamic Logic for Message-Passing Systems
Logical Methods in Computer Science 6(3): (2010) |
| 2009 |
| 32 |  | Benedikt Bollig,
Paul Gastin:
Weighted versus Probabilistic Logics.
Developments in Language Theory 2009: 18-38 |
| 31 |  | Benedikt Bollig,
Manuela-Lidia Grindei,
Peter Habermehl:
Realizability of Concurrent Recursive Programs.
FOSSACS 2009: 410-424 |
| 30 |  | Benedikt Bollig,
Peter Habermehl,
Carsten Kern,
Martin Leucker:
Angluin-Style Learning of NFA.
IJCAI 2009: 1004-1009 |
| 2008 |
| 29 |  | Benedikt Bollig,
Joost-Pieter Katoen,
Carsten Kern,
Martin Leucker:
SMA - The Smyle Modeling Approach.
CEE-SET 2008: 103-117 |
| 28 |  | Benedikt Bollig,
Joost-Pieter Katoen,
Carsten Kern,
Martin Leucker:
Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning.
CONCUR 2008: 162-166 |
| 27 |  | S. Akshay,
Benedikt Bollig,
Paul Gastin,
Madhavan Mukund,
K. Narayan Kumar:
Distributed Timed Automata with Independently Evolving Clocks.
CONCUR 2008: 82-97 |
| 26 |  | Mohamed Faouzi Atig,
Benedikt Bollig,
Peter Habermehl:
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete.
Developments in Language Theory 2008: 121-133 |
| 25 |  | Benedikt Bollig:
On the Expressive Power of 2-Stack Visibly Pushdown Automata
CoRR abs/0812.2423: (2008) |
| 24 |  | Benedikt Bollig,
Dietrich Kuske:
Muller message-passing automata and logics.
Inf. Comput. 206(9-10): 1084-1094 (2008) |
| 23 |  | Benedikt Bollig:
On the Expressive Power of 2-Stack Visibly Pushdown Automata.
Logical Methods in Computer Science 4(4): (2008) |
| 2007 |
| 22 |  | S. Akshay,
Benedikt Bollig,
Paul Gastin:
Automata and Logics for Timed Message Sequence Charts.
FSTTCS 2007: 290-302 |
| 21 |  | Benedikt Bollig,
Dietrich Kuske,
Ingmar Meinecke:
Propositional Dynamic Logic for Message-Passing Systems.
FSTTCS 2007: 303-315 |
| 20 |  | Benedikt Bollig,
Dietrich Kuske:
Muller Message-Passing Automata and Logics.
LATA 2007: 163-174 |
| 19 |  | Benedikt Bollig,
Ingmar Meinecke:
Weighted Distributed Systems and Their Logics.
LFCS 2007: 54-68 |
| 18 |  | 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 |
| 17 |  | Benedikt Bollig:
Formal Models of Communicating Systems - Languages, Automata, and Monadic Second-Order Logic
Springer 2006: I-IX, 1-181 |
| 16 |  | Benedikt Bollig,
Carsten Kern,
Markus Schlütter,
Volker Stolz:
MSCan - A Tool for Analyzing MSC Specifications.
TACAS 2006: 455-458 |
| 15 |  | Benedikt Bollig,
Martin Leucker:
Message-passing automata are expressively equivalent to EMSO logic.
Theor. Comput. Sci. 358(2-3): 150-172 (2006) |
| 2005 |
| 14 |  | Benedikt Bollig:
On the Expressiveness of Asynchronous Cellular Automata.
FCT 2005: 528-539 |
| 13 |  | Benedikt Bollig,
Martin Leucker:
A Hierarchy of Implementable MSC Languages.
FORTE 2005: 53-67 |
| 12 |  | Benedikt Bollig:
Automata and logics for message sequence charts.
RWTH Aachen University 2005: 1-157 |
| 2004 |
| 11 |  | 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 |  | Benedikt Bollig,
Martin Leucker:
Verifying Qualitative Properties of Probabilistic Programs.
Validation of Stochastic Systems 2004: 124-146 |
| 2003 |
| 8 |  | 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 |  | Benedikt Bollig,
Martin Leucker,
Thomas Noll:
Generalised Regular MSC Languages.
FoSSaCS 2002: 52-66 |
| 5 |  | Benedikt Bollig,
Martin Leucker,
Philipp Lucas:
Extending Compositional Message Sequence Graphs.
LPAR 2002: 68-85 |
| 4 |  | Benedikt Bollig,
Martin Leucker,
Michael Weber:
Local Parallel Model Checking for the Alternation-Free µ-Calculus.
SPIN 2002: 128-147 |
| 2001 |
| 3 |  | Benedikt Bollig,
Martin Leucker,
Michael Weber:
Parallel Model Checking for the Alternation Free µ-Calculus.
TACAS 2001: 543-558 |
| 2 |  | Benedikt Bollig,
Martin Leucker:
Deciding LTL over Mazurkiewicz Traces.
TIME 2001: 189-197 |
| 1 |  | Benedikt Bollig,
Martin Leucker:
Modelling, Specifying, and Verifying Message Passing Systems.
TIME 2001: 240-247 |