2019 # Checking Deadlock-Freedom of Parametric Component-Based Systems

**Abstract:** We propose an automated method for computing inductive invariants used to proving deadlock freedom of parametric component-based systems. The method generalizes the approach for computing structural trap invariants from bounded to parametric systems with general architectures. It symbolically extracts trap invariants from interaction formulae defining the system architecture. The paper presents the theoretical foundations of the method, including new results for the first order monadic logic and proves its sou…

Help me understand this report

Search citation statements

Paper Sections

Select...

1

1

1

1

Citation Types

0

10

0

Year Published

2020

2021

Publication Types

Select...

5

1

Relationship

3

3

Authors

Journals

(10 citation statements)

0

10

0

“…Usually, computing invariants requires building a sequence of underapproximants whose limit is the least fixed point of an abstraction of the transition relation of the system [20]. This is not the case of the trap invariant, that can be directly computed from the trap constraint and the initial marking [11,15].…”

confidence: 99%

“…Usually, computing invariants requires building a sequence of underapproximants whose limit is the least fixed point of an abstraction of the transition relation of the system [20]. This is not the case of the trap invariant, that can be directly computed from the trap constraint and the initial marking [11,15].…”

confidence: 99%

“…Grenoble Alpes 3 We use the term architecture for the shape of the graph along which the interactions take place. rameterized systems in [15], but the work there is only applicable to clique architectures, in which processes are indistinguishable, and the system can be described by one single Petri Net with an infinite family of initial markings. Here, for the first time, we show that the trap technique can be extended to pipelines, token rings and trees, where the system is defined by an infinite family of Petri Nets, each with a different structure.…”

confidence: 99%

“…To verify correctness of the parametric interacting system of a motif we extend the approach adopted for static BIP: assuming that dynamic connectors correctly enforce the sought coordination, it remains to show that restricting the behavior of deadlock-free components does not introduce deadlocks. We have recently shown this approach can be extended for parametric systems [5].…”

confidence: 99%

“…In order to guarantee the deadlock freedom, two methods are provided: Invariant preservation of one additional invariant, and model checking through animation (Bozga et al 2019). The first method is based on adding an invariant that include the disjunction of all the model events guards.…”

confidence: 99%