English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path along the model of the system. However, a single computation path is not enough to explain all reasons of a validity or a failure. Our work in this area is motivated by the application of action-based model checking algorithms to the test case generation for models formally specied with a CCS-like process algebra. There, only linear and nite witnesses and counterexamples are useful and for the given formula and model an ecien t representation of the set of witnesses (counterexamples) explaining all reasons of validity (failure) is needed. This paper identies a fragment of an action-based computa- tion tree logic (ACTL), that guarantee linear witnesses and counterexam- ples. For it, witness and counterexample automata are introduced, which are nite automata recognizing linear witnesses and counterexamples, respectively. An algorithm for generating such automata is given.

Witness and Counterexample Automata for ACTL