scholarly journals State Identification for Labeled Transition Systems with Inputs and Outputs

2020 ◽  
pp. 191-212
Author(s):  
Petra van den Bos ◽  
Frits Vaandrager
Keyword(s):  
Transition Systems ◽  
State Identification ◽  
Inputs And Outputs

Overparametrized Deep Encoder-Decoder Schemes for Inputs and Outputs Defined over Graphs

2021 ◽  
Author(s):  
Samuel Rey ◽  
Victor Tenorio ◽  
Sergio Rozada ◽  
Luca Martino ◽  
Antonio G. Marques
Keyword(s):  
Inputs And Outputs

Neural Transition Systems for Modeling Hierarchical Semantic Representations

2019 ◽  
Author(s):  
Riyaz Bhat ◽  
John Chen ◽  
Rashmi Prasad ◽  
Srinivas Bangalore
Keyword(s):  
Semantic Representations ◽  
Transition Systems

The scientific and technical bases for inputs and outputs of men's pants production

2015 ◽  
Vol 31 (31) ◽  
pp. 91-108
Author(s):  
Azza Mohammed Helmy Ibrahim Salam
Keyword(s):  
Inputs And Outputs

scholarly journals Battery transition systems

2014 ◽  
Vol 49 (1) ◽  
pp. 595-606 ◽  
Author(s):  
Udi Boker ◽  
Thomas A. Henzinger ◽  
Arjun Radhakrishna
Keyword(s):  
Transition Systems

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

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.

Sign in / Sign up

Export Citation Format

Share Document