• Publications
  • Influence
State Class Constructions for Branching Analysis of Time Petri Nets
TLDR
This paper is concerned with construction of some state space abstractions for Time Petri nets. Expand
  • 137
  • 34
UEML: Towards a unified enterprise modelling language
TLDR
The paper presents the rationale and principles of a unified language devoted to the area of Enterprise Modelling. Expand
  • 214
  • 17
  • PDF
Fiacre: an Intermediate Language for Model Verification in the Topcased Environment
TLDR
We present the Fiacre intermediate language for model verification in the TOPCASED environment. Expand
  • 155
  • 15
  • PDF
Time Petri Nets Analysis with TINA
TLDR
Beside the usual graphic editing and simulation facilities, the software tool Tina may build a number of state space abstractions for Petri nets, preserving certain classes of properties. Expand
  • 124
  • 12
  • PDF
Bridging the Gap Between Timed Automata and Bounded Time Petri Nets
TLDR
We compare Timed Automata with Bounded Time Petri Nets extended with static Priorities, and show that two large subsets of these models are equally expressive in terms of weak timed bisimilarity. Expand
  • 68
  • 10
Covering Step Graph
TLDR
An algorithm for the “on the fly” derivation of step graphs is proposed. Expand
  • 48
  • 6
Model Checking Bounded Prioritized Time Petri Nets
TLDR
In a companion paper [BPV06], we investigated the expressiveness of Time Petri Nets extended with Priorities and showed that it is very close to that Timed Automata, in terms of weak timed bisimilarity. Expand
  • 41
  • 5
  • PDF
Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches
TLDR
We first introduce a simple class of TPNs extended with stopwatches (SwTPNs), and present a semi-algorithm for building exact representations of the behavior of SwTPNs, based on the known state class method for Time Petri nets. Expand
  • 66
  • 4
  • PDF
Ladder Metamodeling and PLC Program Validation through Time Petri Nets
TLDR
We propose a model driven approach for formal verification of LD programs through model-checking. Expand
  • 30
  • 4
On Combining the Persistent Sets Method with the Covering Steps Graph Method
TLDR
This paper investigates the combination of two such approaches, persistent sets and covering steps, and proposes partial enumeration algorithms that cumulate their respective benefits. Expand
  • 21
  • 4