4 Search Results for "�brah�m, Erika"

Document
DOI: 10.4230/OASIcs.ATMOS.2020.16
Probabilistic Simulation of a Railway Timetable

Authors: Rebecca Haehn, Erika Ábrahám, and Nils Nießen

Published in: OASIcs, Volume 85, 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)

Abstract
Railway systems are often highly utilized, which makes them vulnerable to delay propagation. In order to minimize delays timetables are desired to be robust, a property that is often estimated by simulating the respective timetable for different deterministic delay values. To achieve an accurate estimation under consideration of uncertain delays many simulation runs need to be executed. Most established simulation systems additionally use microscopic models of the railway systems, which further increases the simulations running times and makes them applicable rather for small areas of interest for complexity reasons. In this paper, we present a probabilistic, symbolic simulation algorithm for given timetables, this means we do not simulate individual executions, but all possible executions at once. We use a macroscopic model of the railway infrastructure as input. This way we consider the railway systems in less detail but are able to examine certain performance indicators for larger areas. For a given input model this simulation computes exact results. We implement the algorithm, examine its results, and discuss possible improvements of this approach.
Cite as

Rebecca Haehn, Erika Ábrahám, and Nils Nießen. Probabilistic Simulation of a Railway Timetable. In 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020). Open Access Series in Informatics (OASIcs), Volume 85, pp. 16:1-16:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{haehn_et_al:OASIcs.ATMOS.2020.16,
  author =	{Haehn, Rebecca and \'{A}brah\'{a}m, Erika and Nie{\ss}en, Nils},
  title =	{{Probabilistic Simulation of a Railway Timetable}},
  booktitle =	{20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)},
  pages =	{16:1--16:14},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-170-2},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{85},
  editor =	{Huisman, Dennis and Zaroliagis, Christos D.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2020.16},
  URN =		{urn:nbn:de:0030-drops-131527},
  doi =		{10.4230/OASIcs.ATMOS.2020.16},
  annote =	{Keywords: Railway, Modeling, Scheduling, Probabilistic systems, Optimization}
}
Document
DOI: 10.4230/DagRep.5.11.71
Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 15471)

Authors: Erika Ábrahám, Pascal Fontaine, Thomas Sturm, and Dongming Wang

Published in: Dagstuhl Reports, Volume 5, Issue 11 (2016)

Abstract
The seminar focused on satisfiability checking for combinations of first-order logic and subclasses thereof with arithmetic theories in a very liberal sense, also covering quantifiers and parameters. It gathered members of the two communities of symbolic computation (or computer algebra) and satisfiability checking (including satisfiability modulo theories). Up-to-now, these two communities have been working quite independently. We are confident that the seminar will initiate cross-fertilization of both fields and bring improvements for both satisfiability checking and symbolic computation, and for their applications.
Cite as

Erika Ábrahám, Pascal Fontaine, Thomas Sturm, and Dongming Wang. Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 15471). In Dagstuhl Reports, Volume 5, Issue 11, pp. 71-89, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@Article{abraham_et_al:DagRep.5.11.71,
  author =	{\'{A}brah\'{a}m, Erika and Fontaine, Pascal and Sturm, Thomas and Wang, Dongming},
  title =	{{Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 15471)}},
  pages =	{71--89},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{11},
  editor =	{\'{A}brah\'{a}m, Erika and Fontaine, Pascal and Sturm, Thomas and Wang, Dongming},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.11.71},
  URN =		{urn:nbn:de:0030-drops-57657},
  doi =		{10.4230/DagRep.5.11.71},
  annote =	{Keywords: algorithmic algebra, arithmetic, automated reasoning, decision procedures, quantifier elimination, satisfiability checking, SMT solving, symbolic comp}
}
Document
DOI: 10.4230/DagRep.4.1.36
Randomized Timed and Hybrid Models for Critical Infrastructures (Dagstuhl Seminar 14031)

Authors: Erika Ábrahám, Alberto Avritzer, Anne Remke, and William H. Sanders

Published in: Dagstuhl Reports, Volume 4, Issue 1 (2014)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 14031 "Randomized Timed and Hybrid Models for Critical Infrastructures". Critical Infrastructures, such as power grid and water and gas distribution networks, are essential for the functioning of our society and economy. Randomized Timed and Hybrid Models appear as a natural choice for their modeling, and come with existing algorithms and tool support for their analysis. However, on the one hand, the Critical Infrastructures community does not yet make full use of recent advances for Randomized Timed and Hybrid Models. On the other hand, existing algorithms are not yet readily applicable to the special kind of problems arising in Critical Infrastructures. This seminar brought together researchers from these fields to communicate with each other and to exchange knowledge, experiences and needs.
Cite as

Erika Ábrahám, Alberto Avritzer, Anne Remke, and William H. Sanders. Randomized Timed and Hybrid Models for Critical Infrastructures (Dagstuhl Seminar 14031). In Dagstuhl Reports, Volume 4, Issue 1, pp. 36-82, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)

Copy BibTex To Clipboard

@Article{abraham_et_al:DagRep.4.1.36,
  author =	{\'{A}brah\'{a}m, Erika and Avritzer, Alberto and Remke, Anne and Sanders, William H.},
  title =	{{Randomized Timed and Hybrid Models for Critical Infrastructures (Dagstuhl Seminar 14031)}},
  pages =	{36--82},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{1},
  editor =	{\'{A}brah\'{a}m, Erika and Avritzer, Alberto and Remke, Anne and Sanders, William H.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.4.1.36},
  URN =		{urn:nbn:de:0030-drops-45355},
  doi =		{10.4230/DagRep.4.1.36},
  annote =	{Keywords: Critical Infrastructures, Smart Grids, Modeling, Randomized Timed and Hybrid Models, Analysis}
}
Document
DOI: 10.4230/DagSemProc.04401.8
Numerical Approximation of Parabolic Stochastic Partial Differential Equations

Authors: Erika Hausenblas

Published in: Dagstuhl Seminar Proceedings, Volume 4401, Algorithms and Complexity for Continuous Problems (2005)

Abstract
The topic of the talk were the time approximation of quasi linear stochastic partial differential equations of parabolic type. The framework were in the setting of stochastic evolution equations. An error bounds for the implicit Euler scheme was given and the stability of the scheme were considered.
Cite as

Erika Hausenblas. Numerical Approximation of Parabolic Stochastic Partial Differential Equations. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{hausenblas:DagSemProc.04401.8,
  author =	{Hausenblas, Erika},
  title =	{{Numerical Approximation of Parabolic Stochastic Partial Differential Equations}},
  booktitle =	{Algorithms and Complexity for Continuous Problems},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4401},
  editor =	{Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.8},
  URN =		{urn:nbn:de:0030-drops-1417},
  doi =		{10.4230/DagSemProc.04401.8},
  annote =	{Keywords: Stochastic Partial Differential Equations , Stochastic evolution Equations , Numerical Approximation , implicit Euler scheme}
}
  • Refine by Author
  • 3 Ábrahám, Erika
  • 1 Avritzer, Alberto
  • 1 Fontaine, Pascal
  • 1 Haehn, Rebecca
  • 1 Hausenblas, Erika
  • Show More...

  • Refine by Classification
  • 1 Computing methodologies → Model development and analysis

  • Refine by Keyword
  • 2 Modeling
  • 1 Analysis
  • 1 Critical Infrastructures
  • 1 Numerical Approximation
  • 1 Optimization
  • Show More...

  • Refine by Type
  • 4 document

  • Refine by Publication Year
  • 1 2005
  • 1 2014
  • 1 2016
  • 1 2020

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact