The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Given a timed automaton $\mathcal P$<alternatives> <inline-graphic xlink:href="wang-ieq1-2653778.gif"/></alternatives> modeling an implementation and a timed automaton $\mathcal S$<alternatives> <inline-graphic xlink:href="wang-ieq2-2653778.gif"/></alternatives> as a specification, the problem of language inclusion checking is to decide whether...
This paper deals with model checking problems with respect to LTL properties under fairness assumptions. We first present an efficient algorithm to deal with a fragment of fairness assumptions and then extend the algorithm to handle arbitrary ones. Notably, by making use of some syntactic transformations, our algorithm avoids constructing corresponding Büchi automata for the whole fairness assumptions,...
The use of deductive techniques, such as theorem provers, has several advantages in safety verification of hybrid systems; however, state-of-the-art theorem provers require manual intervention to handle complex systems. Furthermore, there is often a gap between the type of assistance that a theorem prover requires to make progress on a proof task and the assistance that a system designer is able to...
Verification condition generators (VCGs) can reduce overall correctness statements about sequential programs to verification conditions (VCs) that can then be proved independently by automatic theorem provers like SMT solvers. SMT solvers became not only more powerful in recent years in that they can now solve much bigger problems than before, they can now also solve problems of less restricted logics,...
Cyber-physical systems (CPS) integrate computation with physical processes. For the last years, CPS have been in the focus of research and are getting adopted in multiple domains like health care, automotive and smart factories. The use of CPS promises dynamic adaption of systems to changing environmental and economic conditions through autonomous CPS decisions based on the physical process. In industrial...
This paper presents a framework to ensure the correctness of service-oriented architectures based on runtime verification techniques. Traditionally, the reliability of safety critical systems is ensured by testing the complete system including all subsystems. When those systems are designed as service-oriented architectures, and independently developed subsystems are composed to new systems at runtime,...
Many state machine based strategies return complete but infinite test suites. A usual approach to guarantee the fault coverage with respect to some kind of faults is to limit the number of faults, i.e., to consider a finite fault domain. In this paper, we summarize some results on deriving complete test suites w.r.t. infinite faults domains but w.r.t. special types of the specification machine.
In component-based safety-critical real-time systems it is crucial to determine which component(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...
Current methods for planning in real-time environments only consider planning goals with a restricted expressiveness, even those using the temporal logic Timed CTL (TCTL). These approaches support TCTL subsets expressing rather simple reachability goals and safety properties, but do not allow the arbitrary nesting and conjunction of TCTL formulas. However, this is a serious drawback in many practical...
Semantic exceptions mean undesirable contexts with respect to application semantics in context aware systems. Description of such semantic exceptions is based on regular expressions, which entails high complexity to detect exceptions. In this paper we devise a high level language with light-weight exception description features specific to context-aware systems. For more enhanced implementation, we...
A model checking procedure, based on the recently introduced linear temporal logic LTL[e] framework, is proposed for the analysis of a class of safety specifications for the synthesis of discrete-event supervisory controllers. A restricted syntax is proposed for capturing specifications which, in our experience, are common in the design of control systems for manufacturing processes. Semantic models...
Traditional Gödel completeness holds between finite proofs and infinite models over formulas of finite depth, where proofs and models are heterogeneous. Our purpose is to provide an interactive form of completeness between infinite proofs and infinite models over formulas of infinite depth (that include recursive types), where proofs and models are homogenous. We work on a nonlinear extension of...
This paper exemplifies principles of embedded system design that props safety and security using operational errors management in frame of a dedicated Computer-Based System architecture. After reviewing basic principles of Cyber-Physical Systems as a novel slant (or marker?) to modeling and design in this domain, attention is focused on a real-world solution of a safety and security critical embedded...
Local policies represent security properties that are applied to (parts of) programs or services. They are amenable for developers since they provide for a full compositionality (through scope nesting), for a simple, automaton-like structure and for a direct enforcing through a corresponding execution monitor. Compliance w.r.t. local policies is statically verified against a safe over-approximation...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.