Combining hybrid Petri nets and hybrid automata
Alexandre Sava, H. Alla
Abstract
Alexandre Sava, H. Alla
Abstract
Hybrid systems have received much attention and a number of different models have been proposed in order to establish a mathematical framework which is able to handle both continuous and discrete aspects. Our research is focused on two models: hybrid automata and hybrid Petri nets (hybrid PNs). First, we deal with studying the hybrid PN functioning. An algorithm is proposed for constructing the hybrid automaton associated with a given hybrid PN. Next, we present the quantitative analysis of hybrid systems modeled by hybrid PN. The approach uses the reachability analysis of hybrid automaton to characterize the periodic functioning of a hybrid PN.
OpenAlex reports 27 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Hybrid systems have received much attention and a number of different models have been proposed in order to establish a mathematical framework which is able to handle both continuous and discrete aspects. Our research is focused on two models: hybrid automata and hybrid Petri nets (hybrid PNs). First, we deal with studying the hybrid PN functioning. An algorithm is proposed for constructing the hybrid automaton associated with a given hybrid PN. Next, we present the quantitative analysis of hybrid systems modeled by hybrid PN. The approach uses the reachability analysis of hybrid automaton to characterize the periodic functioning of a hybrid PN.
Key concepts: Hybrid system, Reachability, Petri net, Hybrid automaton, Automaton, Computer science, Stochastic Petri net, Theoretical computer science