In this paper, we develop an automated framework for formal verification of timed continuous
Petri nets (ContPNs). Specifically, we consider two problems:(1) given an initial set of
markings, construct a set of unreachable markings and (2) given a Linear Temporal Logic
(LTL) formula over a set of linear predicates in the marking space, construct a set of initial
states such that all trajectories originating there satisfy the LTL specification. The starting
point for our approach is the observation that a ContPN system can be expressed as a …

In this paper, we develop an automated framework for formal verification of timed continuous
Petri nets (ContPN). Specifically, we consider two problems:(1) given an initial set of
markings, construct a set of unreachable markings,(2) given a Linear Temporal Logic (LTL)
formula over a set of linear predicates in the marking space, construct a set of initial states
such that all trajectories originating there satisfy the LTL specification. The starting point for
our approach is the observation that a ContPN system can be expressed as a Piecewise …