The aim of the paper is the estimation of sequences in Timed Petri nets. We propose a general strategy composed of two phases: The first phase considers the logical aspect only and suggests candidate count vectors where the second one checks the existence of a relevant time sequence for a Timed Petri net and generate a subspace of time sequences for a given candidate vector
International audiencePetri nets are a powerful formalism for the specification and verification of ...
AbstractThe addition of timing specification in Petri Nets (PN) has followed two main lines: interva...
. Processes of timed Petri nets are represented by labelled partial orders with some extra features....
International audienceThe aim of the paper is the estimation of sequences in Timed Petri nets. We pr...
International audienceIn this paper, we consider the on-line estimation of current subsequences for ...
The aim of this paper is to reconstruct the least/greatest sequence of unobservable transitions in t...
This paper concerns the design of optimal control sequences for timed Petri nets under earliest firi...
This paper deals with the identification of time Petri net systems. An identification algorithm for...
In this paper we present an algebraical approach for the state estimation of discrete event systems,...
It is shown that the behavior of timed Petri nets with deterministic firing times (D-timed nets) and...
This paper concerns the design of optimal control sequences for timed Petri nets under earliest firi...
This thesis proposed an algorithm that can find optimized Petri nets from given observation sequence...
Programme 1 : architectures paralleles, bases de donnees, reseaux et systemes distribuesSIGLEAvailab...
This paper presents an improved timing algorithm for the analysis of timed Petri nets that is based ...
Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analys...
International audiencePetri nets are a powerful formalism for the specification and verification of ...
AbstractThe addition of timing specification in Petri Nets (PN) has followed two main lines: interva...
. Processes of timed Petri nets are represented by labelled partial orders with some extra features....
International audienceThe aim of the paper is the estimation of sequences in Timed Petri nets. We pr...
International audienceIn this paper, we consider the on-line estimation of current subsequences for ...
The aim of this paper is to reconstruct the least/greatest sequence of unobservable transitions in t...
This paper concerns the design of optimal control sequences for timed Petri nets under earliest firi...
This paper deals with the identification of time Petri net systems. An identification algorithm for...
In this paper we present an algebraical approach for the state estimation of discrete event systems,...
It is shown that the behavior of timed Petri nets with deterministic firing times (D-timed nets) and...
This paper concerns the design of optimal control sequences for timed Petri nets under earliest firi...
This thesis proposed an algorithm that can find optimized Petri nets from given observation sequence...
Programme 1 : architectures paralleles, bases de donnees, reseaux et systemes distribuesSIGLEAvailab...
This paper presents an improved timing algorithm for the analysis of timed Petri nets that is based ...
Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analys...
International audiencePetri nets are a powerful formalism for the specification and verification of ...
AbstractThe addition of timing specification in Petri Nets (PN) has followed two main lines: interva...
. Processes of timed Petri nets are represented by labelled partial orders with some extra features....
DOI
Add to ORKG