Search Results

With the growing use of temporal logics in areas ranging from robot planning to runtime verification, it is critical that users have a clear understanding of what a specification means. Toward this end, we have been developing a catalog of ...

Synthesizing a reactive system fulfilling given requirements is an interesting and challenging problem in the field of formal methods. By using temporal logic as specifications, related results have been well applied in the synthesis of Unmanned ...

In [1] we proposed to verify LTL properties using a fine grain analysis classifying formulae into four classes (stutter, shortening, lengthening insensitive or none of these). With this classification we extend the applicability of structural ...

A modular Petri net is composed of multiple individual Petri nets, the modules, by fusing their interface transitions. Internal transitions are not related to other modules. Their behavior is recorded in local reachability graphs for each module. ...

The Net Reduction technique reduces a large model into a smaller model through structural reduction. In model checking, a smaller net means smaller state sizes and explored path lengths. There are many effective reduction rules on low-level net, but on ...

This paper focuses on succinctness results for fragments of Linear Temporal Logic with Past ($\mathsf{LTL}$) devoid of binary temporal operators like until, and provides methods to establish them. We prove that there is a family of cosafety languages ${({\mathcal{L}}_n)}_{n\ge 1}$ ...${\mathcal{}}_{}$$\mathcal{}$${\mathrm{}}^{}$

We propose mutation model checking as an approach to strengthen formal specifications used for model checking. Inspired by mutation testing, our approach concludes that specifications are not strong enough if they fail to detect faults in purposely ...

Modeling and verifying the behavior of Cyber-Physical Systems (CPS) with complex interactions is challenging. Traditional languages such as SysML diagrams are not enough to capture CPS coordination. In this paper, we propose a novel approach ...

We introduce a new logic for expressing multi-properties of system families (Software Product Lines - SPLs). While the standard LTL logic refers only to a single trace at a time, fMultiLTL logic proposed here refers to multiple traces originating from ...

Controller synthesis has been successfully applied in UAV applications, to construct a mission plan that is guaranteed to be correct with respect to a user-provided specification. Albeit being correct, these plans may not be optimal in ...

• Generalized Reactivity(1) is equivalent to Reactivity(1).
• The translation from ...

The organization of temporal properties into a Temporal Hierarchy proposed by Manna and Pnueli is central in the study of the expressive power of fragments of Linear Temporal Logic with Past (LTL + P). A crucial role is played by the ...

We address the problem of measuring inconsistency in declarative process specifications, with an emphasis on linear temporal logic on fixed traces (LTL${}_{\text{ff}}$). As we will show, existing inconsistency measures for classical logic cannot provide a ...

Analyzing the behavior of sensors is becoming one of the key challenges due to their increasing use for decision making in IoT systems. The paper proposes an approach for a formal specification and analysis of such behavior starting from existing ...

• A specification and implementation of Trylock are given.
• The implementation is ...

An example is given of a software algorithm that implements its specification in linear time temporal logic (LTL), but not in branching time temporal logic (CTL). In LTL, a prophecy of future behaviour is needed to prove the ...

[Context and motivation] Requirements formalisation facilitates reasoning about inconsistencies, detection of ambiguities, and identification critical issues in system models. Temporal logic formulae are the natural choice when it comes to ...

The end of Moore’s law and Dennard scaling is shifting the typical computing paradigm towards Approximate Computing. This paper aims to explain an enhanced version of the MESI(Modified Exclusive Shared Invalid) cache coherence protocol ...

Display Omitted

• We have designed MESI-A (a lazy cache coherence protocol to adapt to approximate data at the cache-line granularity.

Transfer learning (TL) is a machine learning (ML) method in which knowledge is transferred from the existing models of related problems to the model for solving the problem at hand. Relational TL enables the ML models to transfer the ...

In this paper, an efficient approach to data validation of distributed geographical interlocking systems (IXLs) is presented. In the distributed IXL paradigm, track elements are controlled by local computers communicating with other control ...

Runtime verification is a complementary approach to testing, model checking and other static verification techniques to verify software properties. Monitorability characterizes what can be verified (monitored) at run time. Different definitions of ...

In the context of formal verification, certifying proofs are evidences of the correctness of a model in a deduction system produced automatically as outcome of the verification. They are quite appealing for high-assurance systems because they can ...