scholarly journals More for free: a dynamic epistemic framework for conformant planning over transition systems*

2017 ◽  
Vol 27 (8) ◽  
pp. 2383-2410 ◽  
Author(s):  
Yanjun Li ◽  
Quan Yu ◽  
Yanjing Wang
Keyword(s):  
Transition Systems ◽  
Conformant Planning

scholarly journals A Logic for Multi-Agent Conformant Planning Over Transition Systems

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 193621-193631
Author(s):  
Peipei Wu ◽  
Yanjun Li
Keyword(s):  
Transition Systems ◽  
Conformant Planning ◽  
Multi Agent

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

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.

scholarly journals Transition-Systems, Event Structures, and Unfoldings

1995 ◽  
Vol 118 (2) ◽  
pp. 191-207 ◽  
Author(s):  
M. Nielsen ◽  
G. Rozenberg ◽  
P.S. Thiagarajan
Keyword(s):  
Transition Systems ◽  
Event Structures

scholarly journals Static Analysis of Featured Transition Systems

2019 ◽  
Author(s):  
Maurice H. ter Beek ◽  
Ferruccio Damiani ◽  
Michael Lienhardt ◽  
Franco Mazzanti ◽  
Luca Paolini
Keyword(s):  
Static Analysis ◽  
Transition Systems

Long-run order-independence of vector-based transition systems

2011 ◽  
Vol 5 (6) ◽  
pp. 468
Author(s):  
M. Raffelsieper ◽  
M.R. Mousavi ◽  
H. Zantema
Keyword(s):  
Transition Systems ◽  
Long Run

Failure Semantics for Modal Transition Systems

2015 ◽  
Vol 14 (4) ◽  
pp. 1-30 ◽  
Author(s):  
Ferenc Bujtor ◽  
Walter Vogler
Keyword(s):  
Transition Systems ◽  
Modal Transition Systems
Sign in / Sign up

Export Citation Format

Share Document