Answers are grounded in this paper and cite their sources.
RTCP-nets are a subclass of timed coloured Petri nets defined for modelling and analysis of embedded real-time systems. One of the main advantages of strongly bounded RTCP-nets is a possibility to present the set of reachable states of an RTCP-net using a finite reachability and/or coverability graph. These graphs can be used to verify most of the net's properties, including the timing ones. The paper discusses analysis methods based on these graphs. A formal definition of RTCP-nets and a survey of their properties are also presented in the paper.
No takes yet. Share an insight, caveat, or question.
Marcin Szpyrka (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: