output
20062021
most citedModel-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable

77 citations

researchers with a paper here
collaborating institutions
Showing 2013Show all

5 papers · 1 filter

cs.FL2013★ 5 cited

Small Universal Petri Nets with Inhibitor Arcs

Sergiu Ivanov, Elisabeth Pelz, Sergey Verlan

We investigate the problem of construction of small-size universal Petri nets with inhibitor arcs. We consider four descriptional complexity parameters: the number of places, trans…

cs.FL2013★ 5 cited

Finite-type-Dyck shift spaces

Marie-Pierre Béal, Michel Blockelet, Cǎtǎlin Dima

We study some basic properties of sofic-Dyck shifts and finite-type-Dyck shifts. We prove that the class of sofic-Dyck shifts is stable under proper conjugacies. We prove a Decompo…

cs.GT2013★ 4 cited

Model Checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics

Rodica Bozianu, Catalin Dima, Constantin Enea

We identify a subproblem of the model-checking problem for the epistemic μ-calculus which is decidable. Formulas in the instances of this subproblem allow free variables within the…

cs.FL2013★ 1 cited

One-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules

Rudolf Freund, Sergiu Ivanov, Marion Oswald +1

We consider the (one-dimensional) array counterpart of contextual as well as insertion and deletion string grammars and consider the operations of array insertion and deletion in a…

cs.FL2013

Sofic-Dyck shifts

Marie-Pierre Béal, Michel Blockelet, Cǎtǎlin Dima

We define the class of sofic-Dyck shifts which extends the class of Markov-Dyck shifts introduced by Inoue, Krieger and Matsumoto. Sofic-Dyck shifts are shifts of sequences whose f…