Author name cluster

Mimmo Parente

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

6 papers

2 author rows

TCS Journal 2020 Journal Article

Model-checking graded computation-tree logic with finite path semantics

Aniello Murano
Mimmo Parente
Sasha Rubin
Loredana Sorrentino

This paper introduces Graded Computation Tree Logic with finite path semantics (GCTL f ⁎, for short), a variant of Computation Tree Logic CTL⁎, in which path quantifiers are interpreted over finite paths and can count the number of such paths. State formulas of GCTL f ⁎ are interpreted over Kripke structures. The syntax of GCTL f ⁎ has path quantifiers of the form E ≥ g ψ which express that there are at least g many distinct finite paths that satisfy ψ. After defining and justifying the logic GCTL f ⁎, we solve its model checking problem and establish that its computational complexity is PSPACE-complete. Moreover, we investigate GCTL f ⁎ under the imperfect information setting. Precisely, we introduce GCTLK f ⁎, an epistemic extension of GCTL f ⁎ and prove that the model checking problem also in this case is PSPACE-complete.

Details DOI

GandALF Workshop 2013 Workshop Paper

Model checking coalitional games in shortage resource scenarios

Dario Della Monica
Margherita Napoli
Mimmo Parente

Verification of multi-agents systems (MAS) has been recently studied taking into account the need of expressing resource bounds. Several logics for specifying properties of MAS have been presented in quite a variety of scenarios with bounded resources. In this paper, we study a different formalism, called Priced Resource-Bounded Alternating-time Temporal Logic (PRBATL), whose main novelty consists in moving the notion of resources from a syntactic level (part of the formula) to a semantic one (part of the model). This allows us to track the evolution of the resource availability along the computations and provides us with a formalisms capable to model a number of real-world scenarios. Two relevant aspects are the notion of global availability of the resources on the market, that are shared by the agents, and the notion of price of resources, depending on their availability. In a previous work of ours, an initial step towards this new formalism was introduced, along with an EXPTIME algorithm for the model checking problem. In this paper we better analyze the features of the proposed formalism, also in comparison with previous approaches. The main technical contribution is the proof of the EXPTIME-hardness of the the model checking problem for PRBATL, based on a reduction from the acceptance problem for Linearly-Bounded Alternating Turing Machines. In particular, since the problem has multiple parameters, we show two fixed-parameter reductions.

PDF Details DOI

TCS Journal 2008 Journal Article

Mixed Nash equilibria in selfish routing problems with dynamic constraints

Alessandro Ferrante
Mimmo Parente

We study the problem of routing traffic through a congested network consisting of m parallel links, each having a certain speed. Moreover, we are given n selfish (non-cooperative) agents, each of them willing to route her own piece of traffic on exactly one link. Agents are selfish in that they only pick a link which minimize the delay of their own piece of traffic. In this context much effort has been lavished in the framework of mixed Nash equilibria where the agent’s routing choices are regulated by probability distributions, one for each agent, which let the system thus enter a steady state from which no agent is willing to unilaterally deviate. In this work we consider situations in which some agents have constraints on the routing choice: in a sense they are forbidden to route their traffic on some links. We show that at most one Nash equilibrium may exist and, in some cases with equal speed links and where each agent is forbidden to route on at most one link, we give necessary and sufficient conditions on its existence; these conditions correlate the traffic load of the agents. We consider also a dynamic behaviour of the network when the constraints may vary, in particular when a constraint is removed: we establish under which conditions the network is still in equilibrium. These conditions are all effective in the sense that, given a set of yes/no routing constraints on each link for each agent, we provide the probability distributions corresponding to the unique Nash equilibrium associated to the constraints (if it exists). Moreover these conditions and the possible Nash equilibrium are computed in time O ( m n ).

Details DOI

LPAR Conference 2008 Conference Paper

Program Complexity in Hierarchical Module Checking

Aniello Murano
Margherita Napoli
Mimmo Parente

Abstract Module checking is a well investigated technique for verifying the correctness of open systems, which are systems characterized by an ongoing interaction with an external environment. In the classical module checking framework, in order to check whether an open system satisfies a required property, we first translate the entire system into an open model ( module ) that collects all possible behaviors of the environment and then check it with respect to a formal specification of the property. Recently, in the case of closed system, Alur and Yannakakis have considered hierarchical structure models in order to have models exponentially more succinct. A hierarchical model uses as nodes both ordinary nodes and supernodes, which are hierarchical models themselves. For CTL specifications, it has been shown that for the simple case of models having only single-exit supernodes, the hierarchical model checking problem is not harder than the classical one. On the contrary, for the more general multiple-exit case, the problem becomes Pspace -complete. In this paper, we investigate the program complexity of the CTL hierarchical module checking problem, that is, we consider the module checking problem for a fixed CTL formula and modules having also supernodes that are modules themselves. By exploiting an automata-theoretic approach through the introduction of hierarchical Büchi tree automata, we show that, in the single-exit case, the addressed problem remains in Ptime, while in the multiple-exit case, it becomes Pspace -complete.

Details

I&C Journal 2008 Journal Article

Verification of scope-dependent hierarchical state machines

Salvatore La Torre
Margherita Napoli
Mimmo Parente
Gennaro Parlato

A hierarchical state machine (Hsm) is a finite state machine where a vertex can either expand to another hierarchical state machine (box) or be a basic vertex (node). Each node is labeled with atomic propositions. We study an extension of such model which allows atomic propositions to label also boxes (Shsm). We show that Shsms can be exponentially more succinct than Shsms and verification is in general harder by an exponential factor. We carefully establish the computational complexity of reachability, cycle detection, and model checking against general Ltl and Ctl specifications. We also discuss some natural and interesting restrictions of the considered problems for which we can prove that Shsms can be verified as much efficiently as Hsms, still preserving an exponential gap of succinctness.

Details DOI

LPAR Conference 2007 Conference Paper

Enriched µ-Calculus Pushdown Module Checking

Alessandro Ferrante
Aniello Murano
Mimmo Parente

Abstract The model checking problem for open systems (called module checking ) has been intensively studied in the literature, both for finite–state and infinite–state systems. In this paper, we focus on pushdown module checking with respect to μ –calculus enriched with graded and nominals ( hybrid graded μ -calulus ). We show that this problem is decidable and solvable in double–exponential time in the size of the formula and in exponential time in the size of the system. This result is obtained by exploiting a classical automata–theoretic approach via pushdown nondeterministic parity tree automata. In particular, we reduce in exponential time our problem to the emptiness problem for these automata, which is known to be decidable in Exptime. As a key step of our algorithm, we show an exponential improvement of the construction of a nondeterministic parity tree automaton accepting all models of a formula of the considered logic. This result, not only allows our algorithm to match the known lower bound, but it is also interesting by itself, since it allows investigating decision problems related to enriched μ -calculus formulas in a greatly simplified manner. We conclude the paper with a discussion on the model checking w. r. t. μ -calculus formulas enriched with backward modalities as well.

Details