PD Dr. Louchka Popova-Zeugmann
Profil
Forschungsthemen1
Vergleichende Analyse und Verifikation für Verteilte Sicherheitskritische Systeme (CAVER)
Quelle ↗Förderer: DFG Sachbeihilfe Zeitraum: 10/2015 - 07/2017 Projektleitung: PD Dr. Louchka Popova-Zeugmann
Mögliche Industrie-Partner10
Stand: 26.4.2026, 19:48:44 (Top-K=20, Min-Cosine=0.4)
Protatuans-Etaireia Ereynas Viotechologias Monoprosopi Etaireia Periorisments Eythinis
P25 Treffer57.4%- Systematic Models for Biological Systems Engineering Training NetworkP57.4%
- Systematic Models for Biological Systems Engineering Training Network
- 26 Treffer57.4%
- Systematic Models for Biological Systems Engineering Training NetworkP57.4%
- Systematic Models for Biological Systems Engineering Training Network
- 26 Treffer57.4%
- Systematic Models for Biological Systems Engineering Training NetworkP57.4%
- Systematic Models for Biological Systems Engineering Training Network
- 25 Treffer57.4%
- Systematic Models for Biological Systems Engineering Training NetworkP57.4%
- Systematic Models for Biological Systems Engineering Training Network
- 18 Treffer56.6%
- INTeractive RObotics Research NetworkP56.6%
- INTeractive RObotics Research Network
- 18 Treffer56.6%
- INTeractive RObotics Research NetworkP56.6%
- INTeractive RObotics Research Network
- 5 Treffer56.1%
- The Pathway to Inquiry Based Science TeachingP56.1%
- The Pathway to Inquiry Based Science Teaching
- 5 Treffer56.1%
- The Pathway to Inquiry Based Science TeachingP56.1%
- The Pathway to Inquiry Based Science Teaching
- 6 Treffer56.1%
- The Pathway to Inquiry Based Science TeachingP56.1%
- The Pathway to Inquiry Based Science Teaching
- 6 Treffer56.1%
- The Pathway to Inquiry Based Science TeachingP56.1%
- The Pathway to Inquiry Based Science Teaching
Publikationen25
Top 25 nach Zitationen — Quelle: OpenAlex (BAAI/bge-m3 embedded für Matching).
111 Zitationen · DOI
Journal of automata, languages and combinatorics · 85 Zitationen
41 Zitationen
Biochemical networks are modelled at different abstraction levels. Basically, qualitative and quantitative models can be distinguished, which are typically treated as separate ones. In this paper, we bridge the gap between qualitative and quantitative models and apply time Petri nets for modelling and analysis of molecular biological systems. We demonstrate how to develop quantitative models of biochemical networks in a systematic manner, starting from the underlying qualitative ones. For this purpose we exploit the well-established structural Petri net analysis technique of transition invariants, which may be interpreted as a characterisation of the system?s steady state behaviour. For the analysis of the derived quantitative model, given as time Petri net, we present structural techniques to decide the time-dependent realisability of a transition sequence and to calculate its shortest and longest time length. All steps of the demonstrated approach consider systems of integer linear inequalities. The crucial point is the total avoidance of any state space construction. Therefore, the presented technology may be applied also to infinite systems, i.e. unbounded Petri nets.
Time Petri Nets
201337 Zitationen · DOI
Fundamenta Informaticae · 20 Zitationen · DOI
In this paper, a parametric description of a transition sequence in a Time Petri net is introduced. The minimal and maximal time duration of a transition sequence are shown to be integers and furthermore the min/max path passes only integer-states. A
Fundamenta Informaticae · 16 Zitationen · DOI
In this paper we examine how it is possible to control Petri net behavior with the help of transition priorities. Controlling here means forcing a process to behave in a stable way by ascribing priorities to transitions and hence transforming a classic Petri net into a Priority Petri net. For Petri net models stability is often ensured by liveness and boundedness. These properties are crucial in many application areas, e.g. workflow modeling, embedded systems design, and bioinformatics. In this paper we study the problem of transforming a given live, but unbounded Petri net into a live and bounded one by adding priority constraints. We specify necessary conditions for the solvability of this problem and present an algorithm for ascribing priorities to net transitions in such a way that the resulting net becomes bounded while staying live.
15 Zitationen
: This paper deals with computing the minimal and maximal execution durations in a given concurrent control system in order to support dependability engineering by assuring the meeting of prescribed deadlines. For that purpose, a new type of time-dependent Petri nets - the Duration Interval Petri net - is introduced, and a dedicated reachability graph is defined in a discrete way. Using this reachability graph, shortest and largest time paths between two arbitrary states of the control system, and by this way minimal and maximal execution times, can be computed. Keywords: system validation, qualitative and quantitative analysis, performance evaluation, worst-case analysis, time-dependent Petri nets, control systems. 1 Petri Net Based Methods to Improve System Dependability Among those methods, which aim at the improvement of the dependability of any system, different kinds of Petri net based validation techniques to avoid faults during the development phase have attracted a lot of atte...
13 Zitationen
Non-reachability proofs in Timed Petrinets were usually done by proving the nonreachability within the underlying timeless net. However, in many cases this approach fails.In this paper, we present an approach to prove non-reachability within the actual Timed Petrinet. For this purpose, we introduce a state equation for Timed Petrinets in analogy to timeless nets. Using this state equation, we can express reachability as a system of equations and inequations, which is solvable in polynomial time.
10 Zitationen
Abstract. In this paper a parametric description for the state space of an arbitrary TPN is given. An enumerative procedure for reducing the state space is introduced. The reduction is defined as a truncated multistage decision problem and solved recursively. A reachability graph is defined in a discrete way by using the reachable integer-states of the TPN.
9 Zitationen
Timed Petri Nets
20137 Zitationen · DOI
Fundamenta Informaticae · 7 Zitationen · DOI
In this paper we consider Interval-Timed Petri nets (ITPN) which are an extension of Timed Petri nets. They are considered to behave with discrete delays. The class of ITPNs is Turing complete and therefore the reachability of an arbitrary marking in
7 Zitationen
Biochemical networks are modelled at different abstraction levels. It is common sense to differentiate between quantitative (kinetic) models and qualitative (stoichiometric or even purely causal) models. The long-term objective of quantitative models is to predict the systems ’ dynamic behaviour. They are commonly used
Fundamenta Informaticae · 7 Zitationen · DOI
Times and priorities are important concepts that are frequently used to model real-world systems. Thus, there exist extensions for Petri nets which allow to model times and priorities. In contrast, many proof techniques are based on classical (time-less and priority-less) Petri nets. However, this approach fails frequently for timed and prioritized Petri nets. In this paper, we present an approach to prove non-reachability in a Priority Duration Petri net. We use for this proving technique a state equation as well as conditions for firing that include a priority rule and a maximal step rule. Our approach leads to a system of equations and inequalities, which provide us with a sufficient condition of non-reachability. We demonstrate the application of our approach with an example.
Systems Analysis Modelling Simulation · 7 Zitationen
Natural Computing · 6 Zitationen · DOI
6 Zitationen
In this paper, we introduce our concept of composability and present the MSS architecture as an example for a composable architecture. MSS claims to be composable with respect to timing properties. We discuss, how to model and prove properties in such an architecture with time-extended Petrinets. As a result, the rst step of a proof of composability is presented as well as a new kind of Petrinet, which is more suitable for modeling architectures like MSS.
Fundamenta Informaticae · 4 Zitationen · DOI
In this paper we consider a class of Time Petri nets defined by structural restrictions. Each Time Petri net which belongs to this class has the property that their liveness behaviour does not depend on the time. Therefore, the Time Petri net is live when its skeleton is live.
Fundamenta Informaticae · 4 Zitationen
In this paper, a method to determine best-case and worst-case times between two arbitrary markings in a bounded TPN is presented. The method uses a discrete subset of the state space of the net and achieves the results, which are integers, in polynomial time. As an application of the method the solution of a scheduling problem is shown.
3 Zitationen · DOI
3 Zitationen · DOI
Ideally, a system's design starts with a formal model. However, in the real world, many systems are designed without a formal model in mind. For these systems, it is hard to show that a formal model meets the informal design. We demonstrate on the example of the composable message scheduled system (MSS) architecture how to bridge the gap between a rather informal description and a formal timed Petri net model. We discuss, how modeling can be done in a "natural" way, so that the mapping between system and model components and the composition of model components is rather obvious. Also, we introduce the tool MGen that support the automatic generation of Petri net models for the MSS architecture.
2 Zitationen · DOI
In this paper we study how it is possible to control Petri net behavior using priority and time constraints. Controlling here means forcing a process to behave in a stable way by associating priorities, or time intervals to transitions and hence transforming a classic Petri net into a Petri net with priorities, or a Time Petri net. For Petri net models stability is often ensured by liveness and boundedness. These properties are crucial in many application areas, e.g. workflow modeling, embedded systems design, and bioinformatics. The paper deals with the problem of transforming a given live, but unbounded Petri net into a live and bounded one by adding transition constraints. We extend the previously proposed priority solution and compare the ability to find solutions with priority and time constraints for a given Petri net.
Introduction
20132 Zitationen · DOI
Programming and Computer Software · 1 Zitationen · DOI
In the paper, a “truly concurrent” and nondeterministic semantics is defined in terms of branching processes of discrete-time Petri nets (DTPNs). These nets may involve infinite numbers of transitions and places, infinite number of tokens in places, and (maximal) steps of concurrent transitions, which allows us to consider this class of DTPNs to be the most powerful class of Petri nets. It is proved that the unfolding (maximal branching process) of the DTPN is the greatest element of a complete lattice constructed on branching processes of DTPNs with step semantics. Moreover, it is shown that this result is true also in the case of maximal transition steps if additional restrictions are imposed on the structure and behavior of the DTPN.
HAL (Le Centre pour la Communication Scientifique Directe) · 1 Zitationen
International audience
Kooperationen0
Bestätigte Forscher↔Partner-Paare aus HU-FIS — Gold-Standard-Positive für das Matching.
Aus HU-FIS sind keine Kooperationen für diese Person gemeldet.
Stammdaten
Identität, Organisation und Kontakt aus HU-FIS.
- Name
- PD Dr. Louchka Popova-Zeugmann
- Titel
- PD Dr.
- Fakultät
- Mathematisch-Naturwissenschaftliche Fakultät
- Institut
- Institut für Informatik
- Arbeitsgruppe
- Theoretische Informatik
- Telefon
- +49 30 2093-41135
- HU-FIS-Profil
- Quelle ↗
- Zuletzt gescrapt
- 26.4.2026, 01:10:35