Mimmo Parente

Enriched mu--calculi module checking,

The model checking problem for open systems has been intensively studied in the literature, for both finite-state (module checking) and infinite-state (pushdown module checking) systems, with respect to Ctl and Ctl*. In this paper, we further investigate this problem with respect to the \mu-calculus enriched with nominals and graded modalities (hybrid graded Mu-calculus), in both the finite-state and infinite-state settings. Using an automata-theoretic approach, we show that hybrid graded \mu-calculus module checking is solvable in exponential time, while hybrid graded \mu-calculus pushdown module checking is solvable in double-exponential time. These results are also tight since they match the known lower bounds for Ctl. We also investigate the module checking problem with respect to the hybrid graded \mu-calculus enriched with inverse programs (Fully enriched \mu-calculus): by showing a reduction from the domino problem, we show its undecidability. We conclude with a short overview of the model checking problem for the Fully enriched Mu-calculus and the fragments obtained by dropping at least one of the additional constructs.

A linear-time algorithm for the feasibility of pebble motion on trees

Abstract. We consider the following pebble motion problem. We are given a tree T with n vertices and two arrangements

Verification of scope-dependent hierarchical state machines

\cal R

On a Logic for Coalitional Games with Priced-Resource Agents

and

THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS

\cal S

Program Complexity in Hierarchical Module Checking

of k<n distinct pebbles numbered 1, . . ., k on distinct vertices of the tree. Pebbles can move along edges of T provided that at any given time at most one pebble is traveling along an edge and each vertex of T contains at most one pebble. We are asked the following question: Is arrangement

Model Checking for Graded CTL

\cal S

CTL Model-Checking with Graded Quantifiers

reachable from

Specification and Verification of Protocols With Time Constraints

\cal R

Optimal time and communication solutions of firing squad synchronization problems on square arrays, toruses and rings

? We present an algorithm that, on input two arrangements of k pebbles on a tree with n vertices, decides in time O(n) whether the two arrangements are reachable from one another. We also give an algorithm that, on input two reachable configurations, returns a sequence of moves that transforms one configuration into the other. The pebble motion problem on trees has various applications including memory management in distributed systems, robot motion planning, and deflection routing.