Jonas Eckhardt
Technische Universität München
30 Papers
241 Citations
Jonas Eckhardt is an academic researcher from Technische Universität München. The author has contributed to research in topics: Requirements engineering & Non-functional requirement. The author has an hindex of 11, co-authored 30 publications. Previous affiliations of Jonas Eckhardt include Information Technology University & Augsburg College.
Chat about Author
Papers
Are "non-functional" requirements really non-functional?: an investigation of non-functional requirements in practice
Jonas Eckhardt,Andreas Vogelsang,Daniel Méndez Fernández +2 more
- 14 May 2016
TL;DR: It is suggested that most "non-functional" requirements are not non-functional as they describe behavior of a system, and it is argued that many so-called NFRs can be handled similarly to functional requirements.
78
Stable availability under denial of service attacks through formal patterns
Jonas Eckhardt,Tobias Mühlbauer,Musab A. Alturki,José Meseguer,Martin Wirsing +4 more
- 24 Mar 2012
TL;DR: This work proposes a formal pattern-based approach to study defense mechanisms against DoS attacks and introduces the notion of stable availability, which means that with very high probability service quality remains very close to a threshold, regardless of how bad the DoS attack can get.
A Requirements Engineering content model for Cyber-Physical Systems
Birgit Penzenstadler,Jonas Eckhardt +1 more
- 12 Nov 2012
TL;DR: The development of highly distributed Systems of Systems (SoS) poses a big challenge on the whole development process of such systems, especially in Requirements Engineering, where one has to cope with the resulting variety of stakeholders and their multitude of different and possibly contradictory goals.
42
Statistical Model Checking for Composite Actor Systems
Jonas Eckhardt,Tobias Mühlbauer,José Meseguer,Martin Wirsing +3 more
- 07 Jun 2012
TL;DR: This paper formalizes a model transformation which—given certain formal requirements—generates a scheduled specification and proves the correctness of the scheduling approach and the soundness of the transformation by introducing the notions of strong zero-time rule confluence and time-passing bisimulation.
Semantics, distributed implementation, and formal analysis of KLAIM models in Maude
TL;DR: This work uses a rewriting-based approach to formally specify and analyze KLAIM specifications of distributed systems and proves that under appropriate weak fairness assumptions all these specifications are stuttering bisimilar and that large classes of logic temporal formulas, namely all CTL * ?
17