2010
DOI: 10.1007/978-3-642-11623-0_10
View full text
|
Sign up to set email alerts
|
Share

Abstract: AbstractLike reachability, coverability is an important tool for verifying behavioural properties of dynamic systems. When a system is modelled as a Petri net, the classical Karp-Miller coverability tree construction can be used to decide questions related to the (required) capacity of local states. Correctness (termination) of the construction is based on a monotonicity property: more resources available implies more behaviour possible. Here we discuss a modification of the coverability tree construction all…

Expand abstract

Search citation statements

Order By: Relevance

Citation Types

0
0
0

Paper Sections

0
0
0
0
0

Publication Types

0
0
0
0

Relationship

0
0

Authors

Journals