Add to ORKGThis paper deals with studying the behaviour of Time Petri nets in a discrete way. It is shown that although a continuous time model is used here, only a few time points are important for the determination of the behaviour of the net. The computation of the boundedness is shown as a recursive-enumerative process. Qualitative and quantitative analysis can be done using only the essential states of the net. (orig.)SIGLEAvailable from TIB Hannover: RR 2036(96) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
A large amount of results can be found in the literature regarding the analysis of discrete event sy...
Petri nets augmented with timing specifications gained a wide acceptance in the area of performance ...
The aim of this paper is to reconstruct the least/greatest sequence of unobservable transitions in t...
In this paper we first give an overview of the dierent approaches to time in Petri nets. If time is ...
Abstract. State explosion is a fundamental problem in the analysis and synthesis of discrete event s...
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Co...
In previous chapters, Place/Transition nets have been used to model Discrete Event Systems with the ...
Abstract. In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which ...
In this paper we discuss several approaches to time in Petri nets. If time is considered for perform...
It is shown that the behavior of timed Petri nets with deterministic firing times (D-timed nets) and...
Continuous Petri nets are an approximation of discrete Petri nets introduced to cope with the state ...
1 Introduction Petri nets [16,11] are a formalism for modeling and analyzing distributed and concurr...
International audienceWe propose an extension of Recursive Petri Nets (TRPNs) based on the semantics...
Abstract. Time-Basic Petri nets, is a powerful formalism for model-ing real-time systems where time ...
Petri Nets are graphical and mathematical tool used in many different science domains. Their charact...
A large amount of results can be found in the literature regarding the analysis of discrete event sy...
Petri nets augmented with timing specifications gained a wide acceptance in the area of performance ...
The aim of this paper is to reconstruct the least/greatest sequence of unobservable transitions in t...
In this paper we first give an overview of the dierent approaches to time in Petri nets. If time is ...
Abstract. State explosion is a fundamental problem in the analysis and synthesis of discrete event s...
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Co...
In previous chapters, Place/Transition nets have been used to model Discrete Event Systems with the ...
Abstract. In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which ...
In this paper we discuss several approaches to time in Petri nets. If time is considered for perform...
It is shown that the behavior of timed Petri nets with deterministic firing times (D-timed nets) and...
Continuous Petri nets are an approximation of discrete Petri nets introduced to cope with the state ...
1 Introduction Petri nets [16,11] are a formalism for modeling and analyzing distributed and concurr...
International audienceWe propose an extension of Recursive Petri Nets (TRPNs) based on the semantics...
Abstract. Time-Basic Petri nets, is a powerful formalism for model-ing real-time systems where time ...
Petri Nets are graphical and mathematical tool used in many different science domains. Their charact...
A large amount of results can be found in the literature regarding the analysis of discrete event sy...
Petri nets augmented with timing specifications gained a wide acceptance in the area of performance ...
The aim of this paper is to reconstruct the least/greatest sequence of unobservable transitions in t...