Compositional Invariant Generation for Timed Systems

Aştefănoaei, Lăcrămioara; Rayana, Souha Ben; Bensalem, Saddek; Bozga, Marius; Combaz, Jacques

doi:10.1007/978-3-642-54862-8_18

Cited by 16 publications

(31 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, they suggest that the cost for causality analysis of smaller problems is very reasonable. In order to tackle larger models -where the cost should be dominated by model-checking Equation (1) -, it would be of interest to investigate the use of compositional verification for timed automata [3]. …”

Section: Resultsmentioning

confidence: 99%

Blaming in component-based real-time systems

Gößler

Aştefănoaei

2014

Proceedings of the 14th International Conference on Embedded Software

View full text Add to dashboard Cite

International audienceIn component-based safety-critical real-time systems it is crucial to determine which com-ponent(s) caused the violation of a required system-level safety property, be it to issue a precise alert, or to determine liability of component providers. In this paper we present an approach for blaming in real-time systems whose component specifications are given as timed automata. The analysis is based on a single execution trace violating a safety property P. We formalize blaming using counterfactual reasoning ("what would have been the outcome if component C had behaved correctly?") to distinguish component failures that actually con-tributed to the outcome from failures that had no impact on the violation of P. We then show how to effectively implement blaming by reducing it to a model-checking problem for timed automata, and demonstrate the feasibility of our approach on the models of a pacemaker and of a chemical reactor

show abstract

Section: Resultsmentioning

confidence: 99%

Blaming in component-based real-time systems

Gößler

Aştefănoaei

2014

Proceedings of the 14th International Conference on Embedded Software

View full text Add to dashboard Cite

show abstract

“…architecture description languages [28] which are not rooted in rigorous semantics and are hardly amenable to formalisation. 3. Theory for ensuring correctness of components.…”

Section: A General Concept Of Componentmentioning

confidence: 99%

“…Let P be a set of ports and consider two glues Bin and T er generated respectively by families of binary and ternary rendezvous operators: rdv (2) a,b and rdv (3) a,b,c , defined by the following rules (for all interactions a, b, c ∈ 2 P ):…”

Section: Expressiveness Of Gluementioning

confidence: 99%

See 1 more Smart Citation

A Theory Agenda for Component-Based Design

Sifakis

Bensalem

Bliudze

et al. 2015

Software, Services, and Systems

Self Cite

View full text Add to dashboard Cite

Abstract. The aim of the paper is to present a theory agenda for component-based design based on results that motivated the development of the BIP component framework, to identify open problems and discuss further research directions. The focus is on proposing a semantically sound theoretical and general framework for modelling componentbased systems and their properties both behavioural and architectural as well for achieving correctness by using scalable specific techniques.We discuss the problem of composing components by proposing the concept of glue as a set of stateless composition operators defined by a certain type of operational semantics rules. We provide an overview of results about glue expressiveness and minimality. We show how interactions and associated transfer of data can be described by using connectors and in particular, how dynamic connectors can be defined as an extension of static connectors. We present two approaches for achieving correctness for component-based systems. One is by compositional inference of global properties of a composite component from properties of its constituents and interaction constraints implied by composition operators. The other is by using and composing architectures that enforce specific coordination properties. Finally, we discuss recent results on architecture specification by studying two types of logics: 1) interaction logics for the specification of sets of allowed interactions; 2) configuration logics for the characterisation of architecture styles.

show abstract

“…Organisation of the paper. This paper is essentially an extended version of the conference paper [5]. The extension is threefold with respect to (1) incorporating proofs, (2) detailing technicalities about handling initial states, and (3) formalising three heuristics to speed up and simplify invariant generation.…”

Section: Figure 1: Compositional Verificationmentioning

confidence: 99%

Compositional Verification for Timed Systems Based on Automatic Invariant Generation

Aştefănoaei¹,

Rayana²,

Bensalem³

et al. 2015

Logical Methods in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We propose a method for compositional verification to address the state space explosion problem inherent to model-checking timed systems with a large number of components. The main challenge is to obtain pertinent global timing constraints from the timings in the components alone. To this end, we make use of auxiliary clocks to automatically generate new invariants which capture the constraints induced by the synchronisations between components. The method has been implemented in the RTDFinder tool and successfully experimented on several benchmarks.

show abstract

Compositional Invariant Generation for Timed Systems

Cited by 16 publications

References 27 publications

Blaming in component-based real-time systems

Blaming in component-based real-time systems

A Theory Agenda for Component-Based Design

Compositional Verification for Timed Systems Based on Automatic Invariant Generation

Contact Info

Product

Resources

About