Published in: LITES, Volume 8, Issue 2 (2022): Special Issue on Distributed Hybrid Systems. Leibniz Transactions on Embedded Systems, Volume 8, Issue 2
Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, and Xavier Urbain. Swarms of Mobile Robots: Towards Versatility with Safety. In LITES, Volume 8, Issue 2 (2022): Special Issue on Distributed Hybrid Systems. Leibniz Transactions on Embedded Systems, Volume 8, Issue 2, pp. 02:1-02:36, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@Article{courtieu_et_al:LITES.8.2.2, author = {Courtieu, Pierre and Rieg, Lionel and Tixeuil, S\'{e}bastien and Urbain, Xavier}, title = {{Swarms of Mobile Robots: Towards Versatility with Safety}}, booktitle = {LITES, Volume 8, Issue 2 (2022): Special Issue on Distributed Hybrid Systems}, pages = {02:1--02:36}, journal = {Leibniz Transactions on Embedded Systems}, ISSN = {2199-2002}, year = {2022}, volume = {8}, number = {2}, editor = {Courtieu, Pierre and Rieg, Lionel and Tixeuil, S\'{e}bastien and Urbain, Xavier}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES.8.2.2}, doi = {10.4230/LITES.8.2.2}, annote = {Keywords: distributed algorithm, mobile autonomous robots, formal proof} }
Published in: LIPIcs, Volume 154, 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)
André Nies and Frank Stephan. Randomness and Initial Segment Complexity for Probability Measures. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 55:1-55:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{nies_et_al:LIPIcs.STACS.2020.55, author = {Nies, Andr\'{e} and Stephan, Frank}, title = {{Randomness and Initial Segment Complexity for Probability Measures}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {55:1--55:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.55}, URN = {urn:nbn:de:0030-drops-119168}, doi = {10.4230/LIPIcs.STACS.2020.55}, annote = {Keywords: algorithmic randomness, probability measure on Cantor space, Kolmogorov complexity, statistical superposition, quantum states} }
Published in: LIPIcs, Volume 150, 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)
Gordon Hoi, Sanjay Jain, and Frank Stephan. A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT. In 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 150, pp. 17:1-17:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{hoi_et_al:LIPIcs.FSTTCS.2019.17, author = {Hoi, Gordon and Jain, Sanjay and Stephan, Frank}, title = {{A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT}}, booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)}, pages = {17:1--17:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-131-3}, ISSN = {1868-8969}, year = {2019}, volume = {150}, editor = {Chattopadhyay, Arkadev and Gastin, Paul}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.17}, URN = {urn:nbn:de:0030-drops-115799}, doi = {10.4230/LIPIcs.FSTTCS.2019.17}, annote = {Keywords: X3SAT Problem, Maximum Hamming Distance of Solutions, Exponential Time Algorithms, DPLL Algorithms} }
Published in: LIPIcs, Volume 149, 30th International Symposium on Algorithms and Computation (ISAAC 2019)
Gordon Hoi and Frank Stephan. Measure and Conquer for Max Hamming Distance XSAT. In 30th International Symposium on Algorithms and Computation (ISAAC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 149, pp. 15:1-15:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{hoi_et_al:LIPIcs.ISAAC.2019.15, author = {Hoi, Gordon and Stephan, Frank}, title = {{Measure and Conquer for Max Hamming Distance XSAT}}, booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)}, pages = {15:1--15:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-130-6}, ISSN = {1868-8969}, year = {2019}, volume = {149}, editor = {Lu, Pinyan and Zhang, Guochuan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.15}, URN = {urn:nbn:de:0030-drops-115119}, doi = {10.4230/LIPIcs.ISAAC.2019.15}, annote = {Keywords: XSAT, Measure and Conquer, DPLL, Exponential Time Algorithms} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Alexander Melnikov, Karen Seidel, and Frank Stephan. Random Subgroups of Rationals. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 25:1-25:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{gao_et_al:LIPIcs.MFCS.2019.25, author = {Gao, Ziyuan and Jain, Sanjay and Khoussainov, Bakhadyr and Li, Wei and Melnikov, Alexander and Seidel, Karen and Stephan, Frank}, title = {{Random Subgroups of Rationals}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {25:1--25:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.25}, URN = {urn:nbn:de:0030-drops-109693}, doi = {10.4230/LIPIcs.MFCS.2019.25}, annote = {Keywords: Martin-L\"{o}f randomness, subgroups of rationals, finitely generated subgroups of rationals, learning in the limit, behaviourally correct learning} }
Published in: LITES, Volume 6, Issue 1 (2019). Leibniz Transactions on Embedded Systems, Volume 6, Issue 1
Pascal Raymond, Claire Maiza, Catherine Parent-Vigouroux, Erwan Jahier, Nicolas Halbwachs, Fabienne Carrier, Mihail Asavoae, and Rémy Boutonnet. Improving WCET Evaluation using Linear Relation Analysis. In LITES, Volume 6, Issue 1 (2019). Leibniz Transactions on Embedded Systems, Volume 6, Issue 1, pp. 02:1-02:28, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@Article{raymond_et_al:LITES-v006-i001-a002, author = {Raymond, Pascal and Maiza, Claire and Parent-Vigouroux, Catherine and Jahier, Erwan and Halbwachs, Nicolas and Carrier, Fabienne and Asavoae, Mihail and Boutonnet, R\'{e}my}, title = {{Improving WCET Evaluation using Linear Relation Analysis}}, booktitle = {LITES, Volume 6, Issue 1 (2019)}, pages = {02:1--02:28}, journal = {Leibniz Transactions on Embedded Systems}, ISSN = {2199-2002}, year = {2019}, volume = {6}, number = {1}, editor = {Raymond, Pascal and Maiza, Claire and Parent-Vigouroux, Catherine and Jahier, Erwan and Halbwachs, Nicolas and Carrier, Fabienne and Asavoae, Mihail and Boutonnet, R\'{e}my}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES-v006-i001-a002}, doi = {10.4230/LITES-v006-i001-a002}, annote = {Keywords: Worst Case Execution Time estimation, Infeasible Execution Paths, Abstract Interpretation} }
Published in: LIPIcs, Volume 114, 10th International Conference on Geographic Information Science (GIScience 2018)
Lionov Wiratma, Maarten Löffler, and Frank Staals. An Experimental Comparison of Two Definitions for Groups of Moving Entities (Short Paper). In 10th International Conference on Geographic Information Science (GIScience 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 114, pp. 64:1-64:6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{wiratma_et_al:LIPIcs.GISCIENCE.2018.64, author = {Wiratma, Lionov and L\"{o}ffler, Maarten and Staals, Frank}, title = {{An Experimental Comparison of Two Definitions for Groups of Moving Entities}}, booktitle = {10th International Conference on Geographic Information Science (GIScience 2018)}, pages = {64:1--64:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-083-5}, ISSN = {1868-8969}, year = {2018}, volume = {114}, editor = {Winter, Stephan and Griffin, Amy and Sester, Monika}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GISCIENCE.2018.64}, URN = {urn:nbn:de:0030-drops-93928}, doi = {10.4230/LIPIcs.GISCIENCE.2018.64}, annote = {Keywords: Trajectories, grouping algorithms, experimental comparison} }
Published in: LIPIcs, Volume 96, 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)
André Nies and Frank Stephan. Closure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations. In 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 96, pp. 51:1-51:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{nies_et_al:LIPIcs.STACS.2018.51, author = {Nies, Andr\'{e} and Stephan, Frank}, title = {{Closure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations}}, booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)}, pages = {51:1--51:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-062-0}, ISSN = {1868-8969}, year = {2018}, volume = {96}, editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.51}, URN = {urn:nbn:de:0030-drops-84938}, doi = {10.4230/LIPIcs.STACS.2018.51}, annote = {Keywords: Computational complexity, Randomness via resource-bounded betting strategies, Martingales, Closure under permutations} }
Published in: LITES, Volume 4, Issue 2 (2017). Leibniz Transactions on Embedded Systems, Volume 4, Issue 2
Florian Kluge, Christine Rochange, and Theo Ungerer. EMSBench: Benchmark and Testbed for Reactive Real-Time Systems. In LITES, Volume 4, Issue 2 (2017). Leibniz Transactions on Embedded Systems, Volume 4, Issue 2, pp. 02:1-02:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@Article{kluge_et_al:LITES-v004-i002-a002, author = {Kluge, Florian and Rochange, Christine and Ungerer, Theo}, title = {{EMSBench: Benchmark and Testbed for Reactive Real-Time Systems}}, booktitle = {LITES, Volume 4, Issue 2 (2017)}, pages = {02:1--02:23}, journal = {Leibniz Transactions on Embedded Systems}, ISSN = {2199-2002}, year = {2017}, volume = {4}, number = {2}, editor = {Kluge, Florian and Rochange, Christine and Ungerer, Theo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES-v004-i002-a002}, doi = {10.4230/LITES-v004-i002-a002}, annote = {Keywords: Real-time benchmark, WCET Analysis, Engine Management System} }
Published in: LITES, Volume 4, Issue 1 (2017). Leibniz Transactions on Embedded Systems, Volume 4, Issue 1
Eric W. D. Rozier, Kristin Y. Rozier, and Ulya Bayram. Characterizing Data Dependence Constraints for Dynamic Reliability Using n-Queens Attack Domains. In LITES, Volume 4, Issue 1 (2017). Leibniz Transactions on Embedded Systems, Volume 4, Issue 1, pp. 05:1-05:26, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@Article{rozier_et_al:LITES-v004-i001-a005, author = {Rozier, Eric W. D. and Rozier, Kristin Y. and Bayram, Ulya}, title = {{Characterizing Data Dependence Constraints for Dynamic Reliability Using n-Queens Attack Domains}}, booktitle = {LITES, Volume 4, Issue 1 (2017)}, pages = {05:1--05:26}, journal = {Leibniz Transactions on Embedded Systems}, ISSN = {2199-2002}, year = {2017}, volume = {4}, number = {1}, editor = {Rozier, Eric W. D. and Rozier, Kristin Y. and Bayram, Ulya}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES-v004-i001-a005}, doi = {10.4230/LITES-v004-i001-a005}, annote = {Keywords: SMT, Data dependence, n-queens} }
Published in: LITES, Volume 3, Issue 1 (2016). Leibniz Transactions on Embedded Systems, Volume 3, Issue 1
Mingsong Lv, Nan Guan, Jan Reineke, Reinhard Wilhelm, and Wang Yi. A Survey on Static Cache Analysis for Real-Time Systems. In LITES, Volume 3, Issue 1 (2016). Leibniz Transactions on Embedded Systems, Volume 3, Issue 1, pp. 05:1-05:48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@Article{lv_et_al:LITES-v003-i001-a005, author = {Lv, Mingsong and Guan, Nan and Reineke, Jan and Wilhelm, Reinhard and Yi, Wang}, title = {{A Survey on Static Cache Analysis for Real-Time Systems}}, booktitle = {LITES, Volume 3, Issue 1 (2016)}, pages = {05:1--05:48}, journal = {Leibniz Transactions on Embedded Systems}, ISSN = {2199-2002}, year = {2016}, volume = {3}, number = {1}, editor = {Lv, Mingsong and Guan, Nan and Reineke, Jan and Wilhelm, Reinhard and Yi, Wang}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES-v003-i001-a005}, doi = {10.4230/LITES-v003-i001-a005}, annote = {Keywords: Hard real-time, Cache analysis, Worst-case execution time} }
Published in: LITES, Volume 2, Issue 1 (2015). Leibniz Transactions on Embedded Systems, Volume 2, Issue 1
Enrico Mezzetti, Marco Ziccardi, Tullio Vardanega, Jaume Abella, Eduardo Quiñones, and Francisco J. Cazorla. Randomized Caches Can Be Pretty Useful to Hard Real-Time Systems. In LITES, Volume 2, Issue 1 (2015). Leibniz Transactions on Embedded Systems, Volume 2, Issue 1, pp. 01:1-01:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@Article{mezzetti_et_al:LITES-v002-i001-a001, author = {Mezzetti, Enrico and Ziccardi, Marco and Vardanega, Tullio and Abella, Jaume and Qui\~{n}ones, Eduardo and Cazorla, Francisco J.}, title = {{Randomized Caches Can Be Pretty Useful to Hard Real-Time Systems}}, booktitle = {LITES, Volume 2, Issue 1 (2015)}, pages = {01:1--01:10}, journal = {Leibniz Transactions on Embedded Systems}, ISSN = {2199-2002}, year = {2015}, volume = {2}, number = {1}, editor = {Mezzetti, Enrico and Ziccardi, Marco and Vardanega, Tullio and Abella, Jaume and Qui\~{n}ones, Eduardo and Cazorla, Francisco J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES-v002-i001-a001}, doi = {10.4230/LITES-v002-i001-a001}, annote = {Keywords: Real-time systems, Probabilistic WCET, Randomized caches} }
Published in: LIPIcs, Volume 30, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)
Rupert Hölzl, Sanjay Jain, and Frank Stephan. Inductive Inference and Reverse Mathematics. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 420-433, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{holzl_et_al:LIPIcs.STACS.2015.420, author = {H\"{o}lzl, Rupert and Jain, Sanjay and Stephan, Frank}, title = {{Inductive Inference and Reverse Mathematics}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {420--433}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.420}, URN = {urn:nbn:de:0030-drops-49324}, doi = {10.4230/LIPIcs.STACS.2015.420}, annote = {Keywords: reverse mathematics, recursion theory, inductive inference, learning from positive data} }
Published in: LITES, Volume 1, Issue 2 (2014). Leibniz Transactions on Embedded Systems, Volume 1, Issue 2
Zhishan Guo and Sanjoy K. Baruah. Implementing Mixed-criticality Systems Upon a Preemptive Varying-speed Processor. In LITES, Volume 1, Issue 2 (2014). Leibniz Transactions on Embedded Systems, Volume 1, Issue 2, pp. 03:1-03:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@Article{guo_et_al:LITES-v001-i002-a003, author = {Guo, Zhishan and Baruah, Sanjoy K.}, title = {{Implementing Mixed-criticality Systems Upon a Preemptive Varying-speed Processor}}, booktitle = {LITES, Volume 1, Issue 2 (2014)}, pages = {03:1--03:19}, journal = {Leibniz Transactions on Embedded Systems}, ISSN = {2199-2002}, year = {2014}, volume = {1}, number = {2}, editor = {Guo, Zhishan and Baruah, Sanjoy K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES-v001-i002-a003}, doi = {10.4230/LITES-v001-i002-a003}, annote = {Keywords: Mixed criticalities, Varying-speed processor, Preemptive uniprocessor scheduling, } }
Published in: LITES, Volume 1, Issue 1 (2014). Leibniz Transactions on Embedded Systems, Volume 1, Issue 1
Jan Reineke. Randomized Caches Considered Harmful in Hard Real-Time Systems. In LITES, Volume 1, Issue 1 (2014). Leibniz Transactions on Embedded Systems, Volume 1, Issue 1, pp. 03:1-03:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@Article{reineke:LITES-v001-i001-a003, author = {Reineke, Jan}, title = {{Randomized Caches Considered Harmful in Hard Real-Time Systems}}, booktitle = {LITES, Volume 1, Issue 1 (2014)}, pages = {03:1--03:13}, journal = {Leibniz Transactions on Embedded Systems}, ISSN = {2199-2002}, year = {2014}, volume = {1}, number = {1}, editor = {Reineke, Jan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES-v001-i001-a003}, doi = {10.4230/LITES-v001-i001-a003}, annote = {Keywords: Real-time systems, Caches, Randomization, WCET analysis} }
Feedback for Dagstuhl Publishing