Zobrazeno 1 - 10
of 237
pro vyhledávání: '"Holger Hermanns"'
Autor:
Sebastian Biewer, Rayna Dimitrova, Michael Fries, Maciej Gazda, Thomas Heinze, Holger Hermanns, Mohammad Reza Mousavi
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 1 (2022)
We present a novel and generalised notion of doping cleanness for cyber-physical systems that allows for perturbing the inputs and observing the perturbed outputs both in the time- and value-domains. We instantiate our definition using existing notio
Externí odkaz:
https://doaj.org/article/998ff7886624487db2c8d638d4699a15
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 286, Iss Proc. CREST 2018, Pp 34-49 (2019)
We find ourselves surrounded by a rapidly increasing number of autonomous and semi-autonomous systems. Two grand challenges arise from this development: Machine Ethics and Machine Explainability. Machine Ethics, on the one hand, is concerned with beh
Externí odkaz:
https://doaj.org/article/7c05853082214548a3a96dca608962a9
Autor:
Felix Freiberger, Holger Hermanns
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 196, Iss Proc. MARS 2015, Pp 25-36 (2015)
This paper discusses the problem of designing a self-balancing unicycle where pedals are used for both power generation and speed control. After developing the principal physical aspects (in the longitudinal dimension), we describe an abstract model
Externí odkaz:
https://doaj.org/article/5495fe4f40d84ff7bfe0a6695ee95f03
Autor:
Bettina Braitling, Luis María Ferrer Fioriti, Hassan Hatefi, Ralf Wimmer, Bernd Becker, Holger Hermanns
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 154, Iss Proc. QAPL 2014, Pp 48-63 (2014)
Markov automata combine continuous time, probabilistic transitions, and nondeterminism in a single model. They represent an important and powerful way to model a wide range of complex real-life systems. However, such models tend to be large and diffi
Externí odkaz:
https://doaj.org/article/db2b6edb92b54e81bce962ecaa994f47
Autor:
Andrea Turrini, Holger Hermanns
Publikováno v:
Logical Methods in Computer Science, Vol Volume 10, Issue 4 (2014)
Probabilistic automata constitute a versatile and elegant model for concurrent probabilistic systems. They are equipped with a compositional theory supporting abstraction, enabled by weak probabilistic bisimulation serving as the reference notion for
Externí odkaz:
https://doaj.org/article/d04b8b714b1f44d2af57b35ac55de34f
Publikováno v:
Logical Methods in Computer Science, Vol Volume 10, Issue 3 (2014)
Markov automata (MAs) extend labelled transition systems with random delays and probabilistic branching. Action-labelled transitions are instantaneous and yield a distribution over states, whereas timed transitions impose a random delay governed by a
Externí odkaz:
https://doaj.org/article/3ac2c4d87a244f7eb6adafb18be67674
Publikováno v:
Logical Methods in Computer Science, Vol Volume 8, Issue 2 (2012)
For continuous-time Markov chains, the model-checking problem with respect to continuous-time stochastic logic (CSL) has been introduced and shown to be decidable by Aziz, Sanwal, Singhal and Brayton in 1996. Their proof can be turned into an approxi
Externí odkaz:
https://doaj.org/article/5c7885929a2a40b5ab101174893d7c37
Publikováno v:
Logical Methods in Computer Science, Vol Volume 4, Issue 4 (2008)
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilistic automata. However, decision algorithms for strong and weak simulatio
Externí odkaz:
https://doaj.org/article/9bc06ae2b7cc4802b730854c90bdcc0f
Autor:
Maximilian A. Köhl, Holger Hermanns
Publikováno v:
ACM Transactions on Embedded Computing Systems.
Online fault diagnosis techniques are a key enabler of effective failure mitigation. For real-time systems, the problem of identifying faults is aggravated by timing imprecisions such as varying latency between events and their observation. This pape
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9ebdfbb0ed84f2cd0f93001ce0aa395
https://doi.org/10.1145/3597209
https://doi.org/10.1145/3597209
Publikováno v:
ACM Transactions on Modeling and Computer Simulation
ACM transactions on modeling and computer simulation, 31(3):14. Association for Computing Machinery (ACM)
ACM transactions on modeling and computer simulation, 31(3):14. Association for Computing Machinery (ACM)
Markov automata are a compositional modelling formalism with continuous stochastic time, discrete probabilities, and nondeterministic choices. In this article, we present extensions to M ODEST , an expressive high-level language with roots in process
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7ef68b6f66bb6eb4e420aec0abe9af0d
https://doi.org/10.1145/3449355
https://doi.org/10.1145/3449355