Topic
State (computer science)
About: State (computer science) is a research topic. Over the lifetime, 24436 publications have been published within this topic receiving 225733 citations.
Papers published on a yearly basis
Papers
More filters
07 Sep 2014
TL;DR: It is shown that LDF f is able to capture, in the logic itself, not only the constraints to be monitored, but also the de-facto standard RV-LTL monitors, which makes it possible to declaratively capture monitoring metaconstraints.
Abstract: Runtime monitoring is one of the central tasks to provide operational decision support to running business processes, and check on-the-fly whether they comply with constraints and rules. We study runtime monitoring of properties expressed in LTL on finite traces (LTF f ) and its extension LDF f . LDF f is a powerful logic that captures all monadic second order logic on finite traces, which is obtained by combining regular expressions with LTF f , adopting the syntax of propositional dynamic logic (PDL). Interestingly, in spite of its greater expressivity, LDF f has exactly the same computational complexity of LTF f . We show that LDF f is able to capture, in the logic itself, not only the constraints to be monitored, but also the de-facto standard RV-LTL monitors. This makes it possible to declaratively capture monitoring metaconstraints, i.e., constraints about the evolution of other constraints, and check them by relying on usual logical services for temporal logics instead of ad-hoc algorithms. This, in turn, enables to flexibly monitor constraints depending on the monitoring state of other constraints, e.g., “compensation” constraints that are only checked when others are detected to be violated. In addition, we devise a direct translation of LDF f formulas into nondeterministic automata, avoiding to detour to Buchi automata or alternating automata, and we use it to implement a monitoring plug-in for the ProM suite.
55 citations
Patent•
20 Jun 2008TL;DR: In this paper, a system and method is described in which the state-of-the-art in automated software applications is significantly improved using interface testing based on a verification language and a verification environment.
Abstract: A system and method is described in which the state of the art in automated software applications is significantly improved. According to some approaches, interface testing is implemented and based upon a verification language and a verification environment. The system and method support the concepts of constrained random test generation, coverage, constrained random generation, and dynamic checks.
55 citations
15 Oct 1991
TL;DR: An improved technique with space requirements proportional to the nesting depth of compound statements (loops and conditionals) in a program is described and dynamic program slicing based on program dependence relations is discussed.
Abstract: Dynamic program slicing based on program dependence relations is discussed. The dynamic dependence relations can be generated in parallel with the execution of a program. The only information that is needed is the identification of the statement that is currently being executed, and the current state of the program (variables that are defined or used). This information is used to update the relations and the intermediate dependence information sets that are maintained for each level of nested compound statements. Once these sets have been updated, the program execution information about the current statement can be discarded and space can be reclaimed. An improved technique with space requirements proportional to the nesting depth of compound statements (loops and conditionals) in a program is described. >
55 citations
TL;DR: The proposed supervisory control architecture is shown to regulate to zero the state of the system without requiring the switching to stop in finite time.
55 citations
TL;DR: Li et al. as mentioned in this paper proposed a hybrid method to achieve stable and real-time battery state of charge (SOC) estimation at different temperatures, composed of an Improved Bidirectional Gated Recurrent Unit (IBGRU) network and Unscented Kalman filtering (UKF).
55 citations