The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Benedikt Bollig: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Benedikt Bollig, Martin Leucker
    Model Checking Probabilistic Distributed Systems. [Citation Graph (0, 0)][DBLP]
    ASIAN, 2003, pp:291-304 [Conf]
  2. Benedikt Bollig, Martin Leucker
    Message-Passing Automata Are Expressively Equivalent to EMSO Logic. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:146-160 [Conf]
  3. Benedikt Bollig
    On the Expressiveness of Asynchronous Cellular Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:528-539 [Conf]
  4. Benedikt Bollig, Martin Leucker
    A Hierarchy of Implementable MSC Languages. [Citation Graph (0, 0)][DBLP]
    FORTE, 2005, pp:53-67 [Conf]
  5. Benedikt Bollig, Martin Leucker, Thomas Noll
    Generalised Regular MSC Languages. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:52-66 [Conf]
  6. Christel Baier, Marcus Größer, Martin Leucker, Benedikt Bollig, Frank Ciesinski
    Controller Synthesis for Probabilistic Systems. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:493-506 [Conf]
  7. Benedikt Bollig, Martin Leucker, Philipp Lucas
    Extending Compositional Message Sequence Graphs. [Citation Graph (0, 0)][DBLP]
    LPAR, 2002, pp:68-85 [Conf]
  8. Benedikt Bollig, Martin Leucker, Michael Weber 0002
    Local Parallel Model Checking for the Alternation-Free µ-Calculus. [Citation Graph (0, 0)][DBLP]
    SPIN, 2002, pp:128-147 [Conf]
  9. Benedikt Bollig, Carsten Kern, Markus Schlütter, Volker Stolz
    MSCan - A Tool for Analyzing MSC Specifications. [Citation Graph (0, 0)][DBLP]
    TACAS, 2006, pp:455-458 [Conf]
  10. Benedikt Bollig, Martin Leucker, Michael Weber 0002
    Parallel Model Checking for the Alternation Free µ-Calculus. [Citation Graph (0, 0)][DBLP]
    TACAS, 2001, pp:543-558 [Conf]
  11. Benedikt Bollig, Martin Leucker
    Deciding LTL over Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    TIME, 2001, pp:189-197 [Conf]
  12. Benedikt Bollig, Martin Leucker
    Modelling, Specifying, and Verifying Message Passing Systems. [Citation Graph (0, 0)][DBLP]
    TIME, 2001, pp:240-247 [Conf]
  13. Benedikt Bollig, Martin Leucker
    Verifying Qualitative Properties of Probabilistic Programs. [Citation Graph (0, 0)][DBLP]
    Validation of Stochastic Systems, 2004, pp:124-146 [Conf]
  14. Benedikt Bollig, Martin Leucker
    Deciding LTL over Mazurkiewicz traces. [Citation Graph (0, 0)][DBLP]
    Data Knowl. Eng., 2003, v:44, n:2, pp:219-238 [Journal]
  15. Benedikt Bollig, Martin Leucker
    Message-passing automata are expressively equivalent to EMSO logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:358, n:2-3, pp:150-172 [Journal]
  16. Benedikt Bollig, Ingmar Meinecke
    Weighted Distributed Systems and Their Logics. [Citation Graph (0, 0)][DBLP]
    LFCS, 2007, pp:54-68 [Conf]
  17. Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker
    Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning. [Citation Graph (0, 0)][DBLP]
    TACAS, 2007, pp:435-450 [Conf]

  18. libalf: The Automata Learning Framework. [Citation Graph (, )][DBLP]


  19. Distributed Timed Automata with Independently Evolving Clocks. [Citation Graph (, )][DBLP]


  20. Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning. [Citation Graph (, )][DBLP]


  21. Realizability of Dynamic MSC Languages. [Citation Graph (, )][DBLP]


  22. Emptiness of Multi-pushdown Automata Is 2ETIME-Complete. [Citation Graph (, )][DBLP]


  23. Weighted versus Probabilistic Logics. [Citation Graph (, )][DBLP]


  24. Realizability of Concurrent Recursive Programs. [Citation Graph (, )][DBLP]


  25. Automata and Logics for Timed Message Sequence Charts. [Citation Graph (, )][DBLP]


  26. Propositional Dynamic Logic for Message-Passing Systems. [Citation Graph (, )][DBLP]


  27. Pebble Weighted Automata and Transitive Closure Logics. [Citation Graph (, )][DBLP]


  28. Angluin-Style Learning of NFA. [Citation Graph (, )][DBLP]


  29. On the Expressive Power of 2-Stack Visibly Pushdown Automata [Citation Graph (, )][DBLP]


  30. Propositional Dynamic Logic for Message-Passing Systems [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002