Abstract We consider Time Petri Nets (TPN) for which a firing time interval is associated with
each transition. State space abstractions for TPN preserving various classes of properties …

In the verification of reactive systems with nondeterministic densely valued temporal
parameters, the state-space can be covered through equivalence classes, each composed …

In this paper, we propose a method for building the state class graph of a bounded time Petri
net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We …

Timed automata are state-machine-like structures used to model real-time systems. Since
their invention in the early 1990s, a number of often subtly differing variants have appeared …

This paper aims at applying the CTL* 1 model checking method to the time Petri net (TPN)
model. We show here how to contract its generally infinite state space into a graph that …

Quantitative evaluation of models with generally-distributed transitions requires analysis of
non-Markovian processes that may be not isomorphic to their underlying untimed models …

The correctness of a time-critical system is closely related to the time of responding and
performing every event. Our motivation example, alternating bit protocol, and application …

We propose in this paper some efficient approaches, based on the state class graph
method, to construct abstractions for the Time Petri Net (TPN) model, suitable to verify its …

Cyber–physical system (CPS) is a complex system that contains multiple components
working cooperatively. According to its characteristics, we propose an object-oriented …

We introduce a semantics for reasoning about probabilistic multi-agent systems in which the
number of participants is not known at design-time. We define the parameterised model …