Publications(deprecated)

2010

  • B. Bollig, J.-P. Katoen, C. Kern, and M. Leucker. Learning Communicating Automata from MSCs. IEEE Transactions on Software Engineering, 2010.
  • B. Bollig, J.-P. Katoen, C. Kern, M. Leucker, D. Neider, and D. Piegdon. libalf: the Automata Learning Framework. In Computer-Aided Verification (CAV 2010). LNCS. Springer-Verlag, accepted 15. March 2010.
  • B. Bollig, J.-P. Katoen, C. Kern, and M. Leucker. SMA – The Smyle Modeling Approach. Computing and Informatics, 2010.
  • M. R. Jongerden, A. Mereacre, H. Bohnenkamp, B. R. Haverkort, and J.-P. Katoen. Computing Optimal Schedules for Battery Usage in Embedded Systems. IEEE Transactions on Industrial Informatics, 6(3), 2010, accepted 18. May 2010.
  • P. Schneider-Kamp, J. Giesl, T. Ströder, A. Serebrenik, and R. Thiemann. Automated Termination Analysis for Logic Programs with Cut. In Proceedings of the 26th International Conference on Logic Programming, Theory and Practice of Logic Programming, Cambridge University Press, 2010. To appear. Accepted on 22.04.2010.
  • J. Giesl, M. Raffelsieper, P. Schneider-Kamp, S. Swiderski, and R. Thiemann. Automated Termination Proofs for Haskell by Term Rewriting. In ACM Transactions on Programming Languages and Systems. ACM Press. New York, USA, 2010. To appear. Accepted on 27.05.2010.
  • M. Lierenfeld, K. Bollue, and D. Abel. Anbindung einer realen Steuerstrecke an Petrinetz-Modellierungssoftware. In EKA 2010 – Entwurf komplexer Automatisierungssysteme. Beschreibungsmittel, Methoden, Werkzeuge und Anwendungen, 11. Fachtagung mit Tutorium, 25.-27.5.2010 in Magdeburg, S. 141-160, ISBN 978-3-940961-41-9. 2010.
  • K. Bollue, S. Wollwage, and D. Abel. NETLAB: Entwurf, Analyse, Test und Synthese hierarchischer Petri-Netz-Modelle und diskreter Steuerungen. In EKA 2010 – Entwurf komplexer Automatisierungssysteme. Beschreibungsmittel, Methoden, Werkzeuge und Anwendungen, 11. Fachtagung mit Tutorium, 25.-27.5.2010 in Magdeburg, S. 39-45, ISBN 978-3-940961-41-9. 2010.
  • W. Fridman. Formats of Winning Strategies for Six Types of Pushdown Games. In Proceedings of the First Symposium on Games, Automata, Logic, and Formal Verification, GandALF 2010, volume 25. EPTCS, 2010.
  • D. Gückel, J. Brauer, and S. Kowalewski. A System for Synthesizing Abstraction-Enabled Simulators for Binary Code Verification. In Proceedings of the 5th IEEE Symposium on Industrial Embedded Systems (SIES 2010), 2010. To appear. Accepted on 01.06.2010.
  • D. Gückel, B. Schlich, J. Brauer, and S. Kowalewski. Synthesizing Simulators for Model Checking Microcontroller Binary Code. In Proceedings of the 13th IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems (DDECS 2010). ISBN 978-1-4244-6611-5, pp. 313-316. 2010.
  • E. Ábrahám and U. Loup. SMT-Solving for the First-Order Theory of the Reals. In Algorithms and Applications for Next Generation SAT Solvers, Dagstuhl Seminar Proceedings. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Germany, 2010.
  • G. B. Mertzios, I. Sau, and S. Zaks. The Recognition of Tolerance and Bounded Tolerance Graphs, to appear in Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS), Nancy, France, March 2010.
  • D. Neider. Reachability Games on Automatic Graphs. In 15th International Conference on Implementation and Application of Automata (CIAA). LNCS. Springer-Verlag, accepted 29. May 2010.
  • B. Puchala and R. Rabinovich. Parity Games with Partial Information Played on Graphs of Bounded Complexity. In Proceedings of MFCS 2010. To appear. Accepted on 28.05.2010.
  • G. Quirós and U. Epple. Model-Based Decentralised Allocation of Product Flow Paths. In Proceedings of the 8th IEEE International Conference on Industrial Informatics (INDIN 2010), Osaka, Japan, July 13-16, 2010.
  • J. Castrillon, R. Velasquez, A. Stulova, W. Sheng, J. Ceng, R. Leupers, G. Ascheid, and Heinrich Meyr. Tracebased KPN Composability Analysis for Mapping Simultaneous Applications to MPSoC Platforms. In Design, Automation and Test in Europe (DATE) Conference, Dresden, Germany, March 2010.
  • J. Spönemann and E. Wendler. Synthesis of Railway Infrastructure. In Proceedings of the 12th International Conference on Computer System Design and Operation in the Railway and other Transit Systems, June 2010. Accepted on 22.06.2010.
  • T. Ströder, P. Schneider-Kamp, and J. Giesl. Dependency Triples for Improving Termination Analysis of Logic Programs with Cut. In Proceedings of the 20th International Symposium on Logic-Based Program Synthesis and Transformation, LNCS, Springer-Verlag, 2010. To appear. Accepted on 14.05.2010.
  • S. Geulen, B. Vöcking, and M. Winkler. Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm. In Proceedings of the 23rd Conference on Learning Theory (COLT 2010), Haifa, Israel, 2010. Accepted on 01.05.2010.
  • S. G. Klabes, Algorithmic Railway Capacity Allocation in a Competitive European Railway Market, PhD thesis, RWTH Aachen University, 2010.
  • M. R. Neuhäußer. Model Checking Nondeterministic and Randomly Timed Systems. PhD Thesis, RWTH Aachen University and University of Twente, 2010.
  • D. Neider and C. Löding. Learning Visibly One-Counter Automata in Polynomial Time. Technical Report AIB-2010-02, RWTH Aachen, January 2010.
  • V. Bilo, A. Fanelli, M. Flammini, L. Moscardelli. When ignorance helps: Graphical multicast cost sharing games. Theor. Comput. Sci. 411(3): 660-671 (2010).
  • M. Hoefer. Competitive Cost Sharing with Economies of Scale. Algorithmica, accepted for publication (Feb 2010).Available at http://algo.rwth-aachen.de/~mhoefer/Forschung/08-0x/Hoefer09EconomiesJ.html
  • K. Chatterjee, F. Horn, and C. Löding. Obliging Games. In Proceedings of the 21st International Conference on Concurrency Theory, CONCUR 2010. To appear.
  • D. Klink, A. Remke, B. R. Haverkort, and J.-P. Katoen. Time-Bounded Reachability in Tree-Structured QBDs by Abstraction. Performance Evaluation, In press, Accepted Manuscript, Available online 31 May 2010, ISSN 0166-5316, DOI: 10.1016/j.peva.2010.04.002.
  • K. Bollue, M. Slaats, E. Ábrahám, W. Thomas, and D. Abel. Synthesis of Behavioral Controllers for DES: Increasing Efficiency. 10th International Workshop on Disceret Event Systems (WODES 2010). To appear.
  • J. Brauer and A. King. Automatic Abstraction for Intervals using Boolean Formulae. 17th International Static Analysis Symposium, SAS 2010. LNCS, Springer. To appear.
  • J. Brauer, T. Noll, and B. Schlich: Interval Analysis of Microcontroller Binary Code using Abstract Interpretation of Hardware and Software. 13th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2010. ACM Press. To appear.
  • J. Brauer, A. King, and S. Kowalewski. Range Analysis of Microcontroller Code using Bit-Level Congruences. 15th International Workshop on Formal Methods for Industrial Critical Systems, FMICS 2010. LNCS, Springer. To appear.

2009

  • D. Fischer, E. Grädel, and Ł. Kaiser. Model Checking Games for the Quantitative μ-Calculus. Theory of Computing Systems, 2009.
  • M. Hoefer. Non-cooperative Tree Creation. Algorithmica 53(1), pp. 104-131, 2009.
  • H. Gimbert and F. Horn. Solving Simple Stochastid Games with Few Random Vertices. In Logical Methods in Computer Science, LMCS, volume 5(2): 9th. International Federation for Computational Logic, 2009.
  • G. B. Mertzios, I. Sau, and Sh. Zaks. A new intersection model and improved algorithms for tolerance graphs, SIAM Journal on Discrete Mathematics, 23(4), pages 1800-1813, 2009.
  • B. Schlich and S. Kowalewski. Model Checking C Source Code for Embedded Systems. In International Journal on Software Tools for Technology Transfer (STTT), vol. 11, iss. 3, pp. 187-202, 2009.
  • K. Bollue, D. Abel, and W. Thomas. Synthesis of Behavioral Controllers for Discrete Event Systems with NCES-like Petri Net Models. In Proceedings of the European Control Conference 2009 – ECC’09, 23-26 August 2009, Budapest, Hungary, pp. 4786-4791. 2009.
  • J. Brauer, R. Huuck, B. Schlich. Interprocedural Pointer Analysis in Goanna. In 4th International Workshop on Systems Software Verification (SSV 2009), Aachen, Germany. Electronic Notes in Theoretical Computer Science, volume 254, pages 65–83, Elsevier, 2009.
  • J. Brauer, B. Schlich, S. Kowalewski. Parallel and Distributed Invariant Checking of Microcontroller Software. In 4th International Workshop on Systems Software Verification (SSV 2009), Aachen, Germany. Electronic Notes in Theoretical Computer Science, volume 254, pages 45–63, Elsevier, 2009.
  • T. Reinbacher, J. Brauer, M. Horauer, B. Schlich. Refining Assembly Code Static Analysis for the Intel MCS-51 Microcontroller. In Industrial Embedded Systems (SIES 2009), Lausanne, Switzerland, pages 161–170. IEEE Computer Society Press, 2009.
  • J. Brauer, B. Schlich, T. Reinbacher, S. Kowalewski. Stack Bounds Analysis for Microcontroller Assembly Code. In 4th Workshop on Embedded Systems Security (WESS 2009), Grenoble, France. ACM, 2009.
  • W. Fridman, J. Olschewski. Transforming Game Specifications into Winning Strategies: A General Study. In Proceedings of GASICS Workshop, Grenoble, June 2009.P. Hänsch, M. Slaats, and W. Thomas. Parametrized Infinite Games and Higher-Order Pushdown Strategies. Extended Abstract. AutoMathA 2009, Automata: from Mathematics to Applications, Liege, Belgium, 2009.
  • P. Hänsch, M. Slaats, and W. Thomas. Parametrized regular infinite games and higher-order pushdown strategies. In FCT 2009, volume 5699 of Lecture Notes in Computer Science, pages 181-192. Springer, 2009.
  • M. Hoefer, L. Olbrich, and A. Skopalik. Doing Good with Spam is Hard. In Proceedings of the 2nd Intl. Symp. Algorithmic Game Theory (SAGT 2009), LNCS 5814, pp. 263-274, 2009.
  • F. Horn. Random Fruits on the Zielonka Tree. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, STACS’09, volume 3 of Leibniz International Proceedings in Informatics, pages 541-552. Dagstuhl Research Online Publication Server, 2009.
  • K. Chatterjee, Th. A. Henzinger and F. Horn. Stochastic Games with Finitary Objectives. In Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science, MFCS’09, volume 5734 of Lecture Notes in Computer Science, pages 34-54. Springer-Verlag, 2009.
  • F. Jarmolowitz, D. Abel, T. Wada, and N. Peters. Control of a homogeneous stirred reactor: Trajectory Piecewise-Linear Model for NMPC. In: Proc. European Control Conference, 2301-2306, 2009.
  • F. Jarmolowitz, D. Abel, T. Wada, and N. Peters. Verbrennungsregelung an einem homogenen Rührreaktor mittels stückweise-linearem Modell und Nichtlinearer Modellprädiktiver Regelung. In: Automation 2009. Der Automatierungskongress in Deutschland, Kongress Baden-Baden, 16. und 17. Juni 2009. VDI-Berichte 2067, S. 425-428. ISBN 978-3-18-092067-2. 2009.
  • V. Bárány, Ł. Kaiser, and A. Rabinovich. Cardinality quantifiers in MLO over trees. In Proceedings of the 18th EACSL Annual Conference on Computer Science Logic, CSL ’09 (E. Grädel and R. Kahle, Eds.), vol. 5771 of LNCS, pp. 117–132. Springer, 2009.
  • E. Grädel, Ł. Kaiser, and R. Rabinovich. Directed Graphs of Entanglement Two. In Proceedings of the 17th International Symposium on Fundamentals of Computation Theory, FCT ’09, vol. 5699 of LNCS, pp. 169–181. Springer, 2009.
  • Ł. Kaiser. Synthesis for Structure Rewriting Systems. In Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science, MFCS ’09, vol. 5734 of LNCS, pp. 415–427. Springer, 2009.
  • B. Bollig, P. Habermehl, C. Kern, and M. Leucker. Angluin-Style Learning of NFA. In Proceedings of the Twentyfirst International Joint Conference on Artificial Intelligence (IJCAI-09). pages 1004-1009. AAAI Press, 2009.
  • S. G. Klabes. Assuring Convergence to Nash Equilibria for the Train Timetabling Problem, 3rd International Seminar on Railway Operations Modelling and Analysis, Zürich, Switzerland, 2009.
  • J.-P. Katoen, D. Klink, and M. R. Neuhäußer. Compositional abstraction for stochastic systems. International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS), volume 5813 of LNCS, pages 195-211. Springer, 2009.
  • D. Klink, A. Remke, B.R. Haverkort, and J.-P. Katoen. Time-bounded reachability in tree-structured QBDs by abstraction. International Conference on Quantitative Evaluation of Systems (QEST), pages 133-142, IEEE Computer Science, 2009.
  • T. Chen, T. Han, J.-P. Katoen, and A. Mereacre. LTL model checking of time-inhomogeneous Markov chains. In 7th International Symposium on Automated Technology for Verification and Analysis (ATVA’09). pages 104–119. Volume 5799 of LNCS. 2009.
  • T. Chen, T. Han, J.-P. Katoen, and A. Mereacre. Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications. In IEEE Symposium on Logic in Computer Science (LICS). IEEE CS Press, 2009.
  • G. B. Mertzios, I. Sau, and S. Zaks, A new intersection model and improved algorithms for tolerance graphs, in Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pages 285-295, Montpellier, France, June 2009.
  • G. B. Mertzios and W. Unger, A Parameterized Algorithm for the Preemptive Scheduling of Equal-Length Jobs, in Proceedings of the 2nd International Conference on Theoretical and Mathematical Foundations of Computer Science (TMFCS), pages 20-27, Orlando, FL, USA, July 2009.
  • G. B. Mertzios, Convergence of Routing Games with Splittable Flows, in Proceedings of the 2nd International Conference on Theoretical and Mathematical Foundations of Computer Science (TMFCS), pages 28-33, Orlando, FL, USA, July 2009.
  • K. Ioannidou, G. B. Mertzios, and S. D. Nikolopoulos, The longest path problem is polynomial on interval graphs, in Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS), pages 403-414, Novy Smokovec, High Tatras, Slovakia, August 2009.
  • M. R. Neuhäußer, M. Stoelinga, and J.-P. Katoen. Delayed Nondeterminism in Continuous-Time Markov Decision Processes. In Foundations of Software Science and Computation Structures (FoSSaCS). pages 364–379. Volume 5504 of LNCS. Springer-Verlag, 2009.
  • M. Bozzano, Alessandro Cimatti, Marco Roveri, J.-P. Katoen, Viet Yen Nguyen, and T. Noll. Co-design of Dependable Systems: A Component-Based Modeling Language. In Proceedings of the 7th ACM-IEEE Int. Conf. on Formal Methods and Models for Codesign (MEMOCODE 2009). pages 121–130. IEEE CS Press, 2009.
  • M. Bozzano, A. Cimatti, J.-P. Katoen, V.Y. Nguyen, T. Noll, and M. Roveri. Model-Based Codesign of Critical Embedded Systems. In Proceedings of the 2nd Int. Workshop on Model Based Architecting and Construction of Embedded Systems (ACES-MB 2009). pages 87–91. Volume 507 of CEUR Workshop Proceedings. 2009.
  • M. Bozzano, A. Cimatti, J.-P. Katoen, V.Y Nguyen, T. Noll, and M. Roveri. The COMPASS Approach: Correctness, Modelling and Performability of Aerospace Systems. In Proceedings of the 28th Int. Conf. on Computer Safety, Reliability and Security (SAFECOMP 2009). pages 173–186. Volume 5775 of LNCS. Springer, 2009.
  • M. Bozzano, A. Cimatti, J.-P. Katoen, V. Y. Nguyen, T. Noll, and M. Roveri. Verification and Performance Evaluation of AADL Models (Tool Demonstration). In Proceedings of the 7th Joint Meeting of European Software Engineering Conf. and ACM SIGSOFT Symp. on the Foundations of Software Engineering (ESEC/FSE 2009). pages 285–286. ACM Press, 2009.
  • H. Grönniger, J. O. Ringert, B. Rumpe. System Model-Based Definition of Modeling Language Semantics. Proc. of FMOODS/FORTE 2009, LNCS 5522. Lisbon, Portugal, 2009.
  • B. Schlich, S. Kowalewski, and J. Wernerus. Verifikation von SPS-Programmen in AWL mit Hilfe von direktem Model-Checking. In Proceedings of AUTOMATION 2009, Baden-Baden, Germany, Düsseldorf, 2009.
  • J. Ceng, W. Sheng, J. Castrillon, A. Stulova, R. Leupers, G. Ascheid, and H. Meyr. A High-Level Virtual Platform for Early MPSoC Software Development. In International Conference on Hardware/Software Codesign and System Synthesis (CODES-ISSS 2009), Grenoble, France, 2009.
  • M. Englert, H. Röglin, J. Spönemann, B. Vöcking. Economical Caching. 26th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 385-396, Freiburg, Germany, 2009.
  • T. Ströder and M. Pagnucco.  Realising Deterministic Behavior from Multiple Non-Deterministic Behaviors. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI ’09), ISBN 978-1-57735-426-0, pp. 936-941, Pasadena, USA, 2009.
  • M. Ummels and D. Wojtczak. Decision Problems for Nash Equilibria in Stochastic Games. In Proceedings of the 18th Annual Conference of the European Association for Computer Science Logic, CSL ’09 (E. Grädel and R. Kahle, Eds.), vol. 5771 of LNCS, pp. 515–530. Springer, 2009.
  • M. Ummels and D. Wojtczak. The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009 (S. Albers, A. Marchetti-Spaccamela, Y. Matias, S. Nikoletseas, and W. Thomas, Eds.), vol. 5556 of LNCS, pp. 297–308. Springer, 2009.
  • M. Englert, B. Vöcking and M. Winkler. Economical Caching With Stochastic Prices. In Proceedings of the 5th International Symposium on Stochastic Algorithms: Foundations and Applications, Sapporo, Japan, October 2009, Lecture Notes in Computer Science 5792, pp. 179-190, Springer 2009.
  • W. Thomas, K. Bollue, D. Gückel, G. Quiros, M. Slaats, and M. Ummels. DFG Research Training Group “Algorithmic Synthesis of Reactive and Discrete-Continuous Systems (AlgoSyn)”. it – Information Technology, vol. 51(4), 2009.
  • K. Bollue, D. Abel (2009): Synthese von Verhaltenssteuerungen für diskret gesteuerte Systeme mit erweiterten Petri-Netz-Modellen. In: Automation 2009. Der Automatierungskongress in Deutschland, Kongress Baden-Baden, 16. und 17. Juni 2009. VDI-Berichte 2067, ISBN 978-3-18-092067-2, S. 433-436, 2009.
  • S. G. Klabes und K. Bollue, Local Search Heuristics for the Train Timetabling Problem, 11th International Conference on Advanced Systems for Public Transport, Hong Kong, China, 2009.
  • U. Loup, Controller Synthesis for Hybrid Systems using SMT Solving, gemeinsamer Workshop der Informatik-Gradiuertenkollegs und Forschungskollegs, Dagstuhl, 2009.
  • G. B. Mertzios, I. Sau, and S. Zaks, A new intersection model and improved algorithms for tolerance graphs, AIB-2009-05, RWTH Aachen University, March 2009.K. Ioannidou, G. B. Mertzios, and S. D. Nikolopoulos, The longest path problem is polynomial on interval graphs, AIB-2009-11, RWTH Aachen University, April 2009.
  • G. B. Mertzios, I. Sau, and S. Zaks, The recognition of tolerance and bounded tolerance graphs is NP-complete, AIB-2009-06, RWTH Aachen University, April 2009.
  • G. B. Mertzios and D. G. Corneil, Vertex splitting and the recognition of trapezoid graphs, AIB-2009-16, RWTH Aachen University, September 2009.
  • A. Fehnker, R. Huuck, B. Schlich, and M. Tapp. Automatic Bug Detection in Microcontroller Software by Static Program Analysis. In Proceedings of SOFSEM 2009: Theory and Practise of Computer Science, Spindleruv Mlýn, Czech Republic, 2009, pp. 267-278.
  • B. Schlich. Model Checking of Software for Microcontrollers. In ACM Transactions in Embedded Computing Systems (TECS), 2009, To appear.
  • S. von Styp. Towards a theory for timed symbolic testing. In Proceedings of Formal Methods 2009 Doctoral Symposium, pages 39–45. Volume 09-15 of CS-Report. Technical University Eindhoven, 2009. To appear in Formal Aspects of Computing.
  • A. Fanelli, L. Moscardelli: On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays. WINE 2009: 55-66.V. Bilo, A. Fanelli, M. Flammini, L. Moscardelli. Performances of One-Round Walks in Linear Congestion Games. SAGT 2009: 311-322.

2008

  • U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer, Z. Nikoloski, D. Wagner. On Modularity Clustering. IEEE Transactions on Knowledge and Data Engineering 20(2), pp. 172-188, 2008.
  • G. B. Mertzios, A matrix characterization of interval and proper interval graphs, Applied Mathematics Letters, 21(4), pages 332-337, 2008.D. Neider. Lernverfahren für Automaten über linearisierten XML-Dokumenten. In Informatik Spektrum, Volume 32, Number 3 / Juni 2009, Seiten 255-259. Springer, 2008.
  • D. Berwanger, K. Chatterjee, L. Doyen, T. A. Henzinger and S. Raje. Strategy Construction for Parity Games with Imperfect Information. Concurrency Theory (CONCUR’08), LNCS 5201, pages 325-339. Springer, 2008.
  • R. Huuck, A. Fehnker, S. Seefried, J. Brauer. Goanna: Syntactic Software Model Checking. In Automated Technology for Verification and Analysis (ATVA 2008). Seoul, Korea, volume 5311 of Lecture Notes in Computer Science, pages 216–221. Springer, 2008.
  • D. Fischer, E. Grädel, and Ł. Kaiser. Model Checking Games for the Quantitative μ-Calculus. In Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008 (S. Albers and P. Weil, Eds.), pp. 301–312, 2008.
  • G. Herberich, B. Schlich, C. Weise, Th. Noll. Proving Correctness of an Efficient Abstraction for Interrupt Handling. Proceedings of the 3rd International Workshop on Systems Software Verification (SSV 2008). Electronic Notes in Theoretical Computer Science. Vol. 217: 133-150. Elsevier, 2008.
  • P. Briest, M. Hoefer, and P. Krysta. Stackelberg Network Pricing Games. In Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008), pp. 133-142, 2008.
  • M. Hoefer, L. Olbrich, and A. Skopalik. Taxing Subnetworks. In Proceedings of the 4th International Workshop on Internet & Network Economics (WINE 2008), LNCS 5385, pp. 286-294, 2008.
  • F. Horn. Dicing on the Streett. Information Processing Letters, volume 104(1), pages 1-9. Elsevier, 2008.
  • F. Horn. Explicit Muller Games are PTIME. In Proceedings of the 28th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS’08, volume 2 of Leibniz International Proceedings in Informatics, pages 235-243. Dagstuhl Research Online Publication Server, 2008.
  • J. Cristau and F. Horn. Graph Games on Ordinals. In Proceedings of the 28th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS’08, volume 2 of Leibniz International Proceedings in Informatics, pages 143-154. Dagstuhl Research Online Publication Server, 2008.
  • J. Cristau and F. Horn. On Reachability Games of Ordinal Length. In Proceedings of the 34th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM’08, volume 4911 of Lecture Notes in Computer Science, pages 211-221. Springer-Verlag, 2008.
  • F. Horn, W. Thomas, and N. Wallmeier. Optimal Strategy Synthesis in Request-Response Games. In Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis, ATVA’08, volume 5311 of Lecture Notes in Computer Science, pages 361-373. Springer-Verlag, 2008.
  • H. Gimbert and F. Horn. Simple Stochastic Games with Few Random Vertices are Easy to Solve. In Proceedings of the 11th International Conference on the Foundations of Software Science and Computational Structures, FoSSaCS’08, volume 4962 of Lecture Notes in Computer Science, pages 5-19. Springer-Verlag, 2008.
  • D. N. Jansen, S. G. Klabes, and E. Wendler. The Impact of GSM-R on Railway Capacity, 11th International Conference on Computer Systems Design and Operations in the Railway and Other Transit Systems, Toledo, Spain, 2008.
  • Ł. Kaiser, S. Rubin, and V. Bárány. Cardinality and counting quantifiers on omega-automatic structures. In Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008 (S. Albers and P. Weil, Eds.), pp. 385–396, 2008.
  • B. Bollig, C. Kern, J.-P. Katoen, and M. Leucker. Smyle: a Tool for Synthesizing Distributed Models from Scenarios by Learning. In 19th International Conference on Concurrency Theory (CONCUR’08). pages 162-166. Volume 5201 of LNCS. Springer, 2008.S.
  • G. Klabes and E. Wendler. A Game Theoretic Approach for Simulation-based Planning of Large Railway Systems, 10th International Conference on Applications of Advanced Technologies in Transportation, Athens, Greece, 2008.
  • J.-P. Katoen, D. Klink, M. Leucker, V. Wolf. Abstraction for stochastic systems by Erlang’s method of stages. International Conference on Concurrency Theory (CONCUR), volume 5201 of LNCS, pages 279-294. Springer, 2008.
  • T. Colcombet and C. Löding. The nesting-depth of disjunctive mu-calculus for tree languages and the limitedness problem. In Proceedings of the 17th EACSL Annual Conference on Computer Science Logic CSL 2008, volume 5213 of Lecture Notes in Computer Science. Springer, 2008.
  • T. Colcombet and C. Löding. The non-deterministic Mostowski hierarchy and distance-parity automata. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, volume 5126 of Lecture Notes in Computer Science, pages 398-409. Springer, 2008.
  • T. Han, J.-P. Katoen, and A. Mereacre. Approximate parameter synthesis for probabilistic time-bounded reachability. In Proceedings of IEEE Real-Time Systems Symposium (RTSS). pages 173–182. IEEE CS Press, 2008.
  • J.-P. Katoen, and A. Mereacre. Model Checking HML On Piecewise-Constant Inhomogeneous Markov Chains. In Formal Modeling and Analysis of Timed Systems (FORMATS). pages 203–217. Volume 5215 of LNCS. Springer-Verlag, 2008.
  • G. B. Mertzios and W. Unger, An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs, in Proceedings of the 19th International Workshop on Combinatorial Algorithms (IWOCA), pages 197-211, Nagoya, Japan, September 2008.
  • G. B. Mertzios and W. Unger, The friendship problem on graphs, in Proceedings of the 1st International Conference on Relations, Orders and Graphs: Interaction with Computer Science (ROGICS), pages 152-158, Mahdia, Tunisia, May 2008.
  • S. Rieger and T. Noll. Abstracting Complex Data Structures by Hyperedge Replacement. In 4th Int. Conference on Graph Transformations (ICGT 2008). pages 69–83. Volume 5214 of LNCS. Springer, 2008.
  • T. Noll and B. Schlich. Delayed Nondeterminism in Model Checking Embedded Systems Assembly Code. In Hardware and Software: Verification and Testing (Haifa Verification Conference, HVC), pages 185–201. Volume 4899 of LNCS. Springer, 2008.
  • L.H. Haß and T. Noll. Equational Abstractions for Reducing the State Space of Rewrite Theories. In Proceedings of the 7th Int. Workshop on Rewriting Logic and its Applications (WRLA 2008). pages 139–154. Volume 238 of ENTCS. Elsevier, 2008.
  • T. Noll and S. Rieger. Verifying Dynamic Pointer Programs. In Proceedings 15th International Symposium on Formal Methods (FM). pages 84–99. Volume 5014 of LNCS. Springer, 2008.
  • R. Jorewitz, G. Quirós, and U. Epple. Modelling of multiple, semantically-coupled flow-graphs. In SOLI 2008, IEEE International Conference on Service Operations and Logistics, and Informatics, pages 965–971, Beijing, China, October 12-15, 2008.
  • B. Schlich, J. Löll, and S. Kowalewski. Application of static analyses for state space reduction to microcontroller assembly code. In Formal Methods for Industrial Critical Systems (FMICS 2007), Berlin, Germany, volume 4916 of Lecture Notes in Computer Science, pages 21–37. Springer, 2008.
  • T. Reinbacher, M. Kramer, M. Horauer, and B. Schlich. Challenges in embedded model checking — a simulator for the [mc]square model checker. In Industrial Embedded Systems (SIES 2008), Le Grande Motte, France, pages 245–248. IEEE Computer Society Press, 2008.
  • J. Beckers, D. Klünder, S. Kowalewski, and B. Schlich. Direct support for model checking of abstract state machines by utilizing simulation. In Abstract State Machines, B and Z (ABZ 2008), London, UK, volume 5238 of Lecture Notes in Computer Science, pages 112–124. Springer, 2008.
  • T. Reinbacher, M. Kramer, M. Horauer, and B. Schlich. Motivating model checking for embedded systems software. In Mechatronic and Embedded Systems and Applications (MESA08), Beijing, China, pages 546–551. IEEE Computer Society Press, 2008.
  • J. Ceng, J. Castrillon, W. Sheng, H. Scharwächter, R. Leupers, G. Ascheid, and H. Meyr, T. Isshiki, and H. Kunieda. MAPS: An Integrated Framework for MPSoC Application Parallelization. In 45th Design Automation Conference (DAC ’08), Anaheim, CA, USA, Jun 2008.
  • A. Carayol and M. Slaats. Positional strategies for higher-order pushdown parity games. In Mathematical Foundations of Computer Science 2008, volume 5162 of Lecture Notes in Computer Science, pages 217-228. Springer, 2008.
  • M. Ummels. The Complexity of Nash Equilibria in Infinite Multiplayer Games. In Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2008 (R. Amadio, Ed.), vol. 4962 of LNCS, pp. 20–34. Springer, 2008.
  • M. Hoefer. Distributed Competition in Networks – Cost Sharing and Graph Clustering with Selfish Agents. VDM Verlag Dr. Müller, ISBN 978-3-8364-9441-0, 2008.B. Schlich. Model Checking of Software for Microcontrollers. Dissertation, RWTH Aachen University, Aachen, Germany, June 2008.
  • N. Wallmeier. Strategien in unendlichen Spielen mit Liveness-Gewinnbedingungen : Syntheseverfahren, Optimierung und Implementierung. PhD thesis, RWTH Aachen, 2008.
  • W. Sheng. J. Castrillon, J. Ceng, H. Scharwächter, R. Leupers, G. Ascheid, Heinrich Meyr, Tsuyoshi Isshiki and Hiroaki Kunieda. MAPS: An Integrated Framework for MPSoC Application Parallelization. In 5th HiPEAC Industrial Workshop, Barcelona, Jun 2008.
  • K. Bollue. AUTOSAR-konforme Kommunikation über den FlexRay-Bus. Eine prototypische Implementierung eines AUTOSAR-konformen FlexRay-Kommunikationsstapels mit Fokus auf dem Transportprotokoll. VDM Verlag, ISBN 978-3-8364-9018-4, 2008.
  • G. B. Mertzios and W. Unger, An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs, AIB-2008-09, RWTH Aachen University, May 2008.
  • G. B. Mertzios, Fast convergence of routing games with splittable flows, AIB-2008-11, RWTH Aachen University, May 2008.
  • G. B. Mertzios and W. Unger, Preemptive scheduling of equal-length jobs in polynomial time, AIB-2008-10, RWTH Aachen University, May 2008.
  • E. Grädel and M. Ummels. Solution Concepts and Algorithms for Infinite Multiplayer Games. In New Perspectives on Games and Interaction (K. Apt and R. van Rooij, Eds.), vol. 4 of Texts in Logic and Games, pp. 151–178. Amsterdam University Press, 2008.
  • L. Zhang, H. Hermanns. F. Eisenbrand, D. N. Jansen. Flow faster: efficient decision algorithms for probabilistic simulations. Logical methods in computer science 4(6)2008, pp. 1–43. Online version.
  • M. Englert, T. Franke, and L. Olbrich. Sensitivity of Wardrop Equilibria. Theory of Computing Systems Special Issue SAGT: 12 – 25.B. Schlich, J. Brauer, S. Kowalewski. Application of Static Analysis for State Space Reduction to Microcontroller Binary Code. In SCP Special Issue on FMICS 2007 and 2008. Springer. Accepted for publication.
  • B. Alarcón, F. Emmes, C. Fuhs, J. Giesl, R. Gutiérrez, S. Lucas, P. Schneider-Kamp, and R. Thiemann. Improving Context-Sensitive Dependency Pairs. In Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR ’08), Doha, Qatar, Lecture Notes in Artificial Intelligence 5330, pages 636-651, 2008. Springer-Verlag.
  • B. Schlich, D. Gückel, and S. Kowalewski. Modeling the Environment of Microcontrollers to Tackle the State-Explosion Problem in Model Checking. In Proceedings of the Symposium on Formal Methods for Automation and Safety in Railway and Automotive Systems (FORMS/FORMAT 2008), ISBN 978 963 236 138 3, pages 27–34, Budapest, Hungary, 2008. L’Harmattan.

2007

  • D. Berwanger, E. Grädel and G. Lenzi. The variable hierarchy of the μ-calculus is strict. In Theory of Computing Systems 40(4), pages 437-466, 2007.
  • C. Löding, C. Lutz, and Olivier Serre. Propositional dynamic logic with recursive programs. Journal of Logic and Algebraic Programming, 73:51-69, 2007.
  • T. Colcombet and C. Löding. Transforming structures by set interpretations. Logical Methods in Computer Science, 3(2), 2007.
  • D. Berwanger. Admissibility in infinite games. Theoretical Aspects of Computer Science (STACS’07), LNCS 4393, pages 188-199. Springer, 2007.
  • U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer, Z. Nikoloski, and D. Wagner. On Finding Graph Clusterings with Maximum Modularity. In Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007), LNCS 4769, pp. 121-132, 2007.
  • M. Hoefer, A. Souza. Tradeoffs and Average-Case Equilibria in Selfish Routing. In Proceedings of the 15th European Symposium on Algorithms (ESA 2007), LNCS 4698, pp. 63-74, 2007.
  • M. Holtmann and Ch. Löding. Memory Reduction for Strategies in Infinite Games. In Jan Holub and Jan ZdÁrek, editors, Implementation and Application of Automata, 12th International Conference, CIAA 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers, volume 4783 of Lecture Notes in Computer Science, pages 253-264. Springer, 2007.
  • F. Horn. Faster Algorithms for Finitary Games. In Proceedings of the 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS’07, volume 4424 of Lecture Notes in Computer Science, pages 472-484. Springer-Verlag, 2007.
  • E. Grädel and Ł. Kaiser. What kind of memory is needed to win infinitary Muller games? In Interactive Logic (J. van Benthem, B. Löwe, and D. Gabbay, Eds.), vol. 1 of Texts in Logic and Games, pp. 89–116. Amsterdam University Press, 2007.
  • 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), pages 435-450. Volume 4424 of Lecture Notes in Computer Science. Springer Verlag, 2007.
  • J.-P. Katoen, D. Klink, M. Leucker, V. Wolf. Three-valued abstraction for continuous-time Markov chains. International Conference on Computer Aided Verification (CAV), volume 4590 of LNCS, pages 311-324. Springer, 2007.
  • M. R. Neuhäußer, and T. Noll. Abstraction and Model Checking of Core Erlang Programs in Maude. In Proceedings of the 6th International Workshop on Rewriting Logic and its Applications. pages 147–163. Volume 176 of ENTCS. Elsevier, 2007.
  • M. R. Neuhäußer, and J.-P. Katoen. Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes. In 18th International Conference on Concurrency Theory (CONCUR). pages 412–427. Volume 4703 of LNCS. Springer-Verlag, 2007.
  • T. Noll and S. Rieger. Composing Transformations to Optimize Linear Code. In Proceedings of the 4th Int. Colloquium on Theoretical Aspects of Computing (ICTAC ’07). pages 425–439. Volume 4711 of LNCS. 2007.
  • J.-P. Katoen, T. Noll, and Stefan Rieger. Verifying Concurrent List-Manipulating Programs by LTL Model Checking. Technical Report 2007-06, RWTH Aachen University, 2007.
  • B. Schlich, F. Salewski, and S. Kowalewski. Applying model checking to an automotive microcontroller application. In Industrial Embedded Systems (SIES’07), Lisbon, Portugal, pages 209–216. IEEE Computer Society Press, 2007.

2006

  • M. Benedict, B. Kuijpers, C. Löding, J. Van den Bussche, and Th. Wilke. A characterization of first-order topological properties of planar spatial data. Journal of the ACM, 53(2):273-305, 2006.
  • C. Löding. Reachability problems on regular ground tree rewriting graphs. Theory of Computing Systems, 39(2):347-383, 2006.
  • K. Indermark, and T. Noll. Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information. Acta Informatica, 43:1–43, 2006.
  • T. Noll, and St. Rieger. Optimization of Straight-Line Code Revisited. Softwaretechnik-Trends, 26(2), 2006.
  • C. Schulte Althoff, W. Thomas, and N. Wallmeier. Observations on determinization of Büchi automata. Theoretical Computer Science, 363(2):224-233, October 2006.
  • D. Berwanger and D. Janin. Automata on Directed Graphs: Vertex versus Edge Marking. Graph Transformations (ICGT’06), LNCS 4178, pages 46-60. Springer, 2006.
  • D. Berwanger, A. Dawar, P. Hunter and S. Kreutzer. DAG-width and parity games. Theoretical Aspects of Computer Science (STACS’06), LNCS 3884, pages 524-536. Springer, 2006.
  • U. Brandes, M. Hoefer, and Ch. Pich. Affiliation Dynamics with an Application to Movie-Actor Biographies. In Proceedings of the 8th Eurographics/IEEE-VGTC Symposium on Visualization (EuroVis 2006), pp. 179-186, 2006.
  • M. Hoefer. Non-cooperative Facility Location and Covering Games. In Proceedings of the 17th Intl. Symp. Algorithms and Computation (ISAAC 2006), LNCS 4288, pp. 369-378, 2006.
  • M. Hoefer. Non-cooperative Tree Creation. In Proceedings of the 31st Intl. Symp. Mathematical Foundations of Computer Science (MFCS 2006), LNCS 4162, pp. 517-527, 2006.
  • J. Cardinal, M. Hoefer. Selfish Service Installation in Networks. In Proceedings of the 2nd International Workshop on Internet & Network Economics (WINE 2006), LNCS 4286, pp. 174-185, 2006.
  • U. Brandes, M. Hoefer, and J. Lerner. WordSpace – Visual Summary of Text Corpora. In Proceedings of SPIE-IS&T Electronic Imaging, SPIE Vol. 6060 (VDA 2006), 60600N, 2006.
  • Ł. Kaiser. Game Quantification on Automatic Structures and Hierarchical Model Checking Games. In Proceedings of the 15th Annual Conference on Computer Science Logic, CSL 2006 (Z. Esik, Ed.), vol. 4207 of LNCS, pp. 411–425. Springer, 2006.
  • 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), pages 455-458. Volume 3920 of Lecture Notes in Computer Science. Springer, 2006.
  • T. Noll and C. K. Roy. Towards Automatic Verification of Erlang Programs by pi-Calculus Translation. In Proceedings of the ACM SIGPLAN 2006 Erlang Workshop, pages 38–50. ACM Press, 2006.
  • J. Palczynski, B. Schlich, and S. Kowalewski. Eine Evaluationssuite zur schnellen Bewertung von Matlab/Simulink-Modelcheckern. In Informatik 2006: Informatik für Menschen (INFORMATIK 2006), Dresden, Germany, volume 1 of Lecture Notes in Informatics, pages 751–755. Gesellschaft für Informatik e.V., 2006.
  • B. Schlich and S. Kowalewski. [mc]square: A model checker for microcontroller code. In Leveraging Applications of Formal Methods, Verification and Validation (ISoLA 2006), Paphos, Cyprus, pages 466–473. IEEE Computer Society Press, 2006.
  • M. Ummels. Rational Behaviour and Strategy Construction in Infinite Multiplayer Games. In Proceedings of the 26th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2006 (S. Arun-Kumar and N. Garg, Eds.), vol. 4337 of LNCS, pp. 212–223. Springer, 2006.
  • J. Ceng, W. Sheng, M. Hohenauer, R. Leupers, G. Ascheid, H. Meyr, G. Braun. Modeling Instruction Semantics in ADL Processor Descriptions for C Compiler Retargeting. In VLSI Signal Processing 43(2-3): 235-246 (2006).

2005

  • M. Hoefer, P. Krysta. Geometric Network Design with Selfish Agents. In Proceedings of the 11th Computing and Combinatorics Conference (COCOON 2005), LNCS 3595, pp. 167-178, 2005.
  • A. Brüning, St. Geisler, M. Hoefer, and O. Kao. QoS Resource Management for Cluster-Based Image Retrieval Systems. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2005), pp. 301-307, CSREA Press, 2005.
  • C. Kern. Analysis and Imlementations of MSC Specifications. In IFM2005 Doctoral Symposium on Integrated Formal Methods. Pages 55-61. TU Eindhoven (NL): Computer Science-Report 05-29. Editors: Judi Romijn, Graeme Smith, Jaco van de Pol, 2005.
  • C. Schulte Althoff, W. Thomas, and N. Wallmeier. Observations on determinization of Büchi automata. In Proceedings of the 10th International Conference on the Implementation and Application of Automata, CIAA 2005, volume 3845 of Lecture Notes in Computer Science, pages 262-272. Springer, 2005.

2004

  • Y. Bontemps, P. Y. Schobbens, and C. Löding. Synthesis of open reactive systems from scenario-based specifications. Fundamenta Informaticae, 62(2):139-169, 2004.

2003

  • N. Wallmeier, P. Hütten, and W. Thomas. Symbolic synthesis of finite-state controllers for request-response specifications. In Proceedings of the 8th International Conference on the Implementation and Application of Automata, CIAA 2003, volume 2759 of Lecture Notes in Computer Science, pages 11-22. Springer, 2003.

2001

  • C. Löding. Efficient minimization of deterministic weak omega-automata. Information Processing Letters, 79(3):105-109, 2001.