Benedikt Bollig

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013

Event clock message passing automata: a logical characterization and an emptiness checking algorithm.

[BibT_eX]

[DOI]

S. Akshay

Formal Methods Syst. Des., 2013

Dynamic Communicating Automata and Branching High-Level MSCs.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2013

Weighted Specifications over Nested Words.

[BibT_eX]

[DOI]

Benjamin Monmege

Proceedings of the Foundations of Software Science and Computation Structures, 2013

A Fresh Approach to Learning Register Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012

An optimal construction of Hanf sentences.

[BibT_eX]

[DOI]

Dietrich Kuske

J. Appl. Log., 2012

Frequency Linear-time Temporal Logic.

[BibT_eX]

[DOI]

Normann Decker

Proceedings of the Sixth International Symposium on Theoretical Aspects of Software Engineering, 2012

Model Checking Languages of Data Words.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2012

A Probabilistic Kleene Theorem.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2012

2011

An Automaton over Data Words That Captures EMSO Logic.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010

Learning Communicating Automata from MSCs.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 2010

Propositional Dynamic Logic for Message-Passing Systems

[BibT_eX]

[DOI]

Dietrich Kuske

Ingmar Meinecke

Log. Methods Comput. Sci., 2010

SMA - The Smyle Modeling Approach.

[BibT_eX]

[DOI]

Comput. Informatics, 2010

Pebble Weighted Automata and Transitive Closure Logics.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Realizability of Dynamic MSC Languages.

[BibT_eX]

[DOI]

Loïc Hélouët

Proceedings of the Computer Science, 2010

libalf: The Automata Learning Framework.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

2009

Angluin-Style Learning of NFA.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

Weighted versus Probabilistic Logics.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008

On the Expressive Power of 2-Stack Visibly Pushdown Automata.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2008

Muller message-passing automata and logics.

[BibT_eX]

[DOI]

Dietrich Kuske

Inf. Comput., 2008

Emptiness of Multi-pushdown Automata Is 2ETIME-Complete.

[BibT_eX]

[DOI]

Mohamed Faouzi Atig

Peter Habermehl

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

2007

Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

Weighted Distributed Systems and Their Logics.

[BibT_eX]

[DOI]

Ingmar Meinecke

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

Automata and Logics for Timed Message Sequence Charts.

[BibT_eX]

[DOI]

S. Akshay

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006

Message-passing automata are expressively equivalent to EMSO logic.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

MSCan - A Tool for Analyzing MSC Specifications.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2006

Formal Models of Communicating Systems - Languages, Automata, and Monadic Second-Order Logic

[BibT_eX]

[DOI]

Springer, ISBN: 3-540-32922-6, 2006

2005

Automata and logics for message sequence charts.

[BibT_eX]

[DOI]

PhD thesis, 2005

A Hierarchy of Implementable MSC Languages.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2005

On the Expressiveness of Asynchronous Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004

Verifying Qualitative Properties of Probabilistic Programs.

[BibT_eX]

[DOI]

Proceedings of the Validation of Stochastic Systems - A Guide to Current Research, 2004

Controller Synthesis for Probabilistic Systems.

[BibT_eX]

[DOI]

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003

Deciding LTL over Mazurkiewicz traces.

[BibT_eX]

Data Knowl. Eng., 2003

Model Checking Probabilistic Distributed Systems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing Science, 2003

2002

Local Parallel Model Checking for the Alternation-Free µ-Calculus.

[BibT_eX]

[DOI]

Michael Weber

Proceedings of the Model Checking of Software, 2002

Extending Compositional Message Sequence Graphs.

[BibT_eX]

[DOI]

Philipp Lucas

Proceedings of the Logic for Programming, 2002

Generalised Regular MSC Languages.

[BibT_eX]

[DOI]

Thomas Noll

Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001

Modelling, Specifying, and Verifying Message Passing Systems.

[BibT_eX]

[DOI]

Proceedings of the Eigth International Symposium on Temporal Representation and Reasoning, 2001

Parallel Model Checking for the Alternation Free µ-Calculus.

[BibT_eX]

[DOI]