Generate & Check Method for Verifying Transition Systems in CafeOBJ

Software, Services, and Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-319-15545-6_13 ◽

2015 ◽

pp. 171-192 ◽

Cited By ~ 5

Author(s):

Kokichi Futatsugi

Keyword(s):

Transition Systems ◽

Check Method

Download Full-text

A Visibility Check Method for Railway Signals using Image Sensor Communication

IEEJ Transactions on Industry Applications ◽

10.1541/ieejias.134.969 ◽

2014 ◽

Vol 134 (11) ◽

pp. 969-977

Author(s):

Nozomi Nagamine ◽

Masato Ukai

Keyword(s):

Image Sensor ◽

Check Method

Download Full-text

Neural Transition Systems for Modeling Hierarchical Semantic Representations

10.21437/interspeech.2019-3075 ◽

2019 ◽

Author(s):

Riyaz Bhat ◽

John Chen ◽

Rashmi Prasad ◽

Srinivas Bangalore

Keyword(s):

Semantic Representations ◽

Transition Systems

Download Full-text

Battery transition systems

ACM SIGPLAN Notices ◽

10.1145/2578855.2535875 ◽

2014 ◽

Vol 49 (1) ◽

pp. 595-606 ◽

Cited By ~ 2

Author(s):

Udi Boker ◽

Thomas A. Henzinger ◽

Arjun Radhakrishna

Keyword(s):

Transition Systems

Download Full-text

The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic

Fundamenta Informaticae ◽

10.3233/fi-2021-1996 ◽

2021 ◽

Vol 178 (1-2) ◽

pp. 1-30

Author(s):

Florian Bruse ◽

Martin Lange ◽

Etienne Lozes

Keyword(s):

Model Checking ◽

Lower Bounds ◽

Expressive Power ◽

Higher Order ◽

Order Logic ◽

High Complexity ◽

Transition Systems ◽

Recursive Formulas ◽

Second Order Logic ◽

Monadic Second Order Logic

Higher-Order Fixpoint Logic (HFL) is a modal specification language whose expressive power reaches far beyond that of Monadic Second-Order Logic, achieved through an incorporation of a typed λ-calculus into the modal μ-calculus. Its model checking problem on finite transition systems is decidable, albeit of high complexity, namely k-EXPTIME-complete for formulas that use functions of type order at most k < 0. In this paper we present a fragment with a presumably easier model checking problem. We show that so-called tail-recursive formulas of type order k can be model checked in (k − 1)-EXPSPACE, and also give matching lower bounds. This yields generic results for the complexity of bisimulation-invariant non-regular properties, as these can typically be defined in HFL.

Download Full-text