IMT Institutional Repository: No conditions. Results ordered -Date Deposited. 2022-08-09T04:33:18ZEPrintshttp://eprints.imtlucca.it/images/logowhite.pnghttp://eprints.imtlucca.it/2016-04-06T12:13:52Z2016-09-13T10:18:31Zhttp://eprints.imtlucca.it/id/eprint/3377This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/33772016-04-06T12:13:52ZSeeing with one's hands: Supramodal cortical organization of perception in the human brain revealed by fMRIPietro Pietrinipietro.pietrini@imtlucca.itMaura L. FureyEmiliano Ricciardiemiliano.ricciardi@imtlucca.itMaria Ida GobbiniMario GuazzelliJames V. Haxby2016-03-23T13:12:34Z2016-09-13T10:18:44Zhttp://eprints.imtlucca.it/id/eprint/3321This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/33212016-03-23T13:12:34ZEffect of healthy aging on the cholinergic modulation of the interaction between prefrontal cortex (PFC) activity and visual working memory (vWM) task difficultyEmiliano Ricciardiemiliano.ricciardi@imtlucca.itPietro Pietrinipietro.pietrini@imtlucca.itStanley I. RapoportMark B. SchapiroMaura L. Furey2016-03-23T13:07:11Z2016-09-13T10:18:01Zhttp://eprints.imtlucca.it/id/eprint/3320This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/33202016-03-23T13:07:11ZIndependent component analysis of fMRI data: a model based approach for artifacts separationIndependent component analysis applied to functional magnetic resonance imaging is a promising technique for non invasive study of brain function. We examine the behavior of spatial ICA decomposition applying ICA to simulated data sets. We study the ICA performances in presence of movement correlated and uncorrelated with activation task, also taking into account the presence of rician distributed noise. We show that the presence of image artifacts due to simulated subject movement and MRI noise greatly affects the method ability to reveal the activation, especially in the presence of movement correlated with activation task. Spatial smoothing of data, before ICA, seems to overcome this problem, allowing us to retrieve the original sources also in the presence of both correlated movement and high noise level.Nicola VanelloVincenzo PositanoEmiliano Ricciardiemiliano.ricciardi@imtlucca.itMaria Filomena SantarelliMario GuazzelliPietro Pietrinipietro.pietrini@imtlucca.itLuigi Landini2016-03-23T13:01:40Z2016-09-13T10:19:00Zhttp://eprints.imtlucca.it/id/eprint/3319This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/33192016-03-23T13:01:40ZSeparation of movement and task related fMRI signal changes in a simulated data set by Independent Component AnalysisNicola VanelloVincenzo PositanoEmiliano Ricciardiemiliano.ricciardi@imtlucca.itMaria Filomena SantarelliMario GuazzelliPietro Pietrinipietro.pietrini@imtlucca.itLuigi Landini2016-03-23T13:00:07Z2016-09-13T10:18:13Zhttp://eprints.imtlucca.it/id/eprint/3318This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/33182016-03-23T13:00:07ZCholinergic Enhancement during Working Memory Eliminates Regional Cerebral Blood Flow (rCBF) Modulation Associated with Task Difficulty in Prefrontal CortexMaura L. FureyEmiliano Ricciardiemiliano.ricciardi@imtlucca.itStanley I. RapoportMark B. SchapiroPietro Pietrinipietro.pietrini@imtlucca.it2016-03-23T12:55:37Z2016-03-23T12:55:37Zhttp://eprints.imtlucca.it/id/eprint/3317This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/33172016-03-23T12:55:37ZPolimorfismi genetici e rischio di sviluppo di demenzaSilvia PellegriniArianna CozzaC. FranceschiniVeronica MariottiMario GuazzelliPietro Pietrinipietro.pietrini@imtlucca.it2016-03-23T12:49:39Z2016-03-23T12:49:39Zhttp://eprints.imtlucca.it/id/eprint/3316This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/33162016-03-23T12:49:39ZEmozioni e sentimenti: come il cervello anima la nostra esistenzaPietro Pietrinipietro.pietrini@imtlucca.it2016-03-23T12:30:26Z2016-03-23T12:30:26Zhttp://eprints.imtlucca.it/id/eprint/3315This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/33152016-03-23T12:30:26ZToward a Biochemistry of Mind?Pietro Pietrinipietro.pietrini@imtlucca.it2014-07-09T14:05:30Z2014-07-09T14:05:30Zhttp://eprints.imtlucca.it/id/eprint/2254This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/22542014-07-09T14:05:30ZUsing MPC as master controller for integrated gasification combined cycle processesThe aim of this work is the design of a master controller for IGCC (Integrated Gasification Combine Cycle) plant, based on an MPC (Model Predictive Control) approach, which is able to coordinate the main process variables interacting with the basic structure of standard controllers at the unit level. Generally, a master controller is obtained by conventional loops based on a “pressure driven” configuration. In the following , the MPC library for MATLAB, by Bemporad, Morari and Ricker (2000) [1] has been applied to a detailed IGCC plant stimulation tool in order to understand the performance of a reliable multivariable linear MPC when adopted for such a nonlinear complex process with crucial targets. A detailed first principle model has been used as a “real plant” when performing the step tests for the identification of the simplified linear model and when checking the reliability of the control tool. Moreover, the effectiveness of the designed controller has been proved through the comparison between the linear MPC approach and an ideal solution (“direct” approach) obtained by the direct inversion of the DAE model, where perfect setpoint tracking is imposed by additional constraint equations and using the corresponding manipulated variables as closing variables. Moreover the performance of the derived MPC controller, when compared with a more conventional control configuration , shows a significant reduction of the overshoots and settling time when the plant is subject to load variations. The paper clearly shows how the MPS approach for a master controller is reliable, easy to design and of real value for practical purposes.Alberto Bemporadalberto.bemporad@imtlucca.itF. RusconiManfred MorariM. Rovaglio2013-11-21T14:33:25Z2014-10-09T09:20:26Zhttp://eprints.imtlucca.it/id/eprint/1921This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/19212013-11-21T14:33:25ZPrediction of real contact area for interfacial debonding damage in fibrous composite materialsGiorgio ZavariseMauro Borri BrunettoMarco Paggimarco.paggi@imtlucca.it2011-11-22T13:30:17Z2011-12-20T12:00:25Zhttp://eprints.imtlucca.it/id/eprint/1017This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/10172011-11-22T13:30:17ZSymmetry reduction and heuristic search for error detection in model checkingThe state explosion problem is the main limitation of model checking. Symmetries in the system being verified can be exploited in order to avoid this problem by defining an equivalence (symmetry) relation on the states of the system, which induces a semantically equivalent quotient system of smaller size. On the other hand, heuristic search algorithms can be applied to improve the bug finding capabilities of model checking. Such algorithms use
heuristic functions to guide the exploration. Bestfirst
is used for accelerating the search, while A* guarantees optimal error trails if combined with admissible estimates. We analyze some aspects of combining both approaches, concentrating on the problem of finding the optimal path to the equivalence class of a given error state. Experimental
results evaluate our approach.Alberto Lluch-Lafuentealberto.lluch@imtlucca.it2011-09-09T13:22:10Z2013-03-05T15:50:22Zhttp://eprints.imtlucca.it/id/eprint/856This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/8562011-09-09T13:22:10ZDNA-Based digital signal processingSotirios A. Tsaftarissotirios.tsaftaris@imtlucca.it2011-07-27T10:51:01Z2011-08-04T07:29:08Zhttp://eprints.imtlucca.it/id/eprint/558This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/5582011-07-27T10:51:01ZApproximate multiparametric convex programmingAlberto Bemporadalberto.bemporad@imtlucca.itCarlo Filippi2011-07-27T09:05:32Z2011-08-05T14:09:02Zhttp://eprints.imtlucca.it/id/eprint/459This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/4592011-07-27T09:05:32ZAn algorithm for multi-parametric quadratic programming and explicit MPC solutionsExplicit solutions to constrained linear model predictive control problems can be obtained by solving multi-parametric quadratic programs (mp-QP) where the parameters are the components of the state vector. We study the properties of the polyhedral partition of the state space induced by the multi-parametric piecewise affine solution and propose a new mp-QP solver. Compared to existing algorithms, our approach adopts a different exploration strategy for subdividing the parameter space, avoiding unnecessary partitioning and QP problem solving, with a significant improvement of efficiency.Petter TondelTor Arne JohansenAlberto Bemporadalberto.bemporad@imtlucca.it2011-07-27T09:04:28Z2011-08-05T14:08:37Zhttp://eprints.imtlucca.it/id/eprint/460This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/4602011-07-27T09:04:28ZEvaluation of piecewise affine control via binary search treeWe present an algorithm for generating a binary search tree that allows efficient computation of piecewise affine (PWA) functions defined on a polyhedral partition. This is useful for PWA control approaches, such as explicit model predictive control, as it allows the controller to be implemented online with small computational effort. The computation time is logarithmic in the number of regions in the PWA partition.Petter TondelTor Arne JohansenAlberto Bemporadalberto.bemporad@imtlucca.it2011-07-27T09:04:23Z2011-08-05T14:08:12Zhttp://eprints.imtlucca.it/id/eprint/556This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/5562011-07-27T09:04:23ZOptimal control of uncertain piecewise affine/mixed logical dynamical systemsThis paper proposes an approach to extend the mixed logical
dynamical modelling framework for synthesizing robust optimal control actions for constrained piecewise affine systems subject to bounded additive input disturbances. Rather than using closed-loop dynamic programming arguments, robustness is achieved here with an open-loop optimization strategy, such that the optimal control sequence optimizes nominal performance while robustly guaranteeing that safety/performance constraints are respected. The proposed approach is based on the robust mode control concept, which enforces the control input
to generate trajectories such that the mode of the system, at each time instant, is independent of the disturbances.Miguel Pedro SilvaAlberto Bemporadalberto.bemporad@imtlucca.itMiguel Ayala BottoJosé Sa da Costa2011-07-27T09:04:20Z2016-05-11T11:07:22Zhttp://eprints.imtlucca.it/id/eprint/487This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/4872011-07-27T09:04:20ZHybrid modeling and optimal control of an asphalt base processBostjan PotocnikAlberto Bemporadalberto.bemporad@imtlucca.itFabio Danilo TorrisiGasper MusicBorut Zupancic2011-07-27T09:04:08Z2011-08-05T14:07:13Zhttp://eprints.imtlucca.it/id/eprint/552This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/5522011-07-27T09:04:08ZReceding-horizon control of LTI systems with quantized inputsThis paper deals with the stabilization problem for a particular class of hybrid systems, namely discrete–time linear systems subject to a uniform (a priori fixed) quantization of the control set. Results of our previous work on the subject provided a description of minimal (in a specific sense) invariant sets that could be rendered maximally attractive under any quantized feedback strategy. In this paper, we consider the design of stabilizing laws that optimize a given cost index on the state and input evolution on a finite, receding horizon. Application of Model Predictive Control techniques for the solution of similar hybrid control problems through Mixed Logical Dynamical reformulations can provide a stabilizing control law, provided that the feasibility hypotheses are met. In this paper, we discuss precisely what are the shortest horizon length and the minimal invariant terminal set for which it can be guaranteed a stabilizing MPC scheme. The final paper will provide an example and simulations of the application of the control scheme to a practical quantized control problem.Bruno PicassoStefania PancantiAlberto Bemporadalberto.bemporad@imtlucca.itAntonio Bicchi2011-07-27T09:04:05Z2011-08-04T07:29:08Zhttp://eprints.imtlucca.it/id/eprint/554This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/5542011-07-27T09:04:05ZSet membership identification of piecewise affine modelsThis paper addresses the problem of identification of piecewise affine (PWA)models, which involves the joint estimations of both the parameters of the affine submodels and the partition of the PWA map from data. According to ideas from set-membership identification, the key approach is to characterize the model by its maximum allowed prediction error, which is used as a tuning knob for traning off between prediction accuracy and model complexity. At initialization, the proposed procedure for PWA identification exploits a technique per partitioning an infeasible system of linear inequalities into a (possibly minimum) number of feasible subsystems. This provides both an initial clustering of the datapoints and a guess of the number of required submodels, which therefore is not fixed a priori. A refinement procedure is then applied in order to improve both data classification and parameter estimation. The partition of the PWA maps is finally estimated by considering multicategory classification techniques.Alberto Bemporadalberto.bemporad@imtlucca.itAndrea GarulliSimone PaolettiAntonio Vicino2011-07-27T09:04:02Z2011-08-04T07:29:08Zhttp://eprints.imtlucca.it/id/eprint/553This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/5532011-07-27T09:04:02ZOptimal state-feedback quadratic regulation of linear hybrid automataFor linear hybrid automata, namely switched linear autonomous systems whose mode of operation is determined by a controlled automaton, in this paper we face the problem of optimal control, where the objective is to minimize a quadratic performance index over an infinite time horizon. The quantities to be optimized are the sequence of switching times and the sequence of modes (or ”locations”), under the following constraints: the sequence of modes has a finite length; the discrete dynamics of the automaton restricts the possible switches from a given location to
the next location, with a cost associated to each switch; the time interval between two consecutive switching times is greater than a fixed quantity. We show how a state-feedback solution can be computed off-line through a numerical procedure.Alberto Bemporadalberto.bemporad@imtlucca.itDaniele CoronaAlessandro GiuaCarla Seatzu2011-07-27T09:04:00Z2011-08-05T14:04:27Zhttp://eprints.imtlucca.it/id/eprint/450This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/4502011-07-27T09:04:00ZA geometric algorithm for multi-parametric linear programmingWe propose a novel algorithm for solving multiparametric linear programming problems. Rather than visiting different bases of the associated LP tableau, we follow a geometric approach based on the direct exploration of the parameter space. The resulting algorithm has computational advantages, namely the simplicity of its implementation in a recursive form and an efficient handling of primal and dual degeneracy. Illustrative examples describe the approach throughout the paper. The algorithm is used to solve finite-time constrained optimal control problems for discrete-time linear dynamical systems.Francesco BorrelliAlberto Bemporadalberto.bemporad@imtlucca.itManfred Morari2011-07-27T09:03:57Z2011-08-04T07:29:08Zhttp://eprints.imtlucca.it/id/eprint/501This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/5012011-07-27T09:03:57ZHybrid control of an automotive robotized gearbox for reduction of consumptions and emissionsThis paper describes the application of hybrid modeling and receding horizon optimal control techniques for supervising an automotive robotized gearbox, with the goal of reducing consumptions and emissions, a problem that is currently under investigation at Fiat Research Center (CRF). We show that the dynamic behavior of the vehicle can be easily approximated and captured by the hybrid model, and through simulations on standard speed patterns that a good closed loop performance can be achieved. The synthesized control law can be implemented on automotive hardware as a piecewise affine function of the measured and estimated quantities. Alberto Bemporadalberto.bemporad@imtlucca.itPandeli BorodaniMassimo Mannelli2011-07-27T09:03:54Z2014-01-24T14:29:49Zhttp://eprints.imtlucca.it/id/eprint/627This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/6272011-07-27T09:03:54ZHybrid Toolbox for MATLAB - User's GuideThe Hybrid Toolbox is a MATLAB/Simulink toolbox for modeling, simulating, and verifying hybrid dynamical systems, for designing and simulating model predictive controllers for hybrid systems subject to constraints, and for generating linear and hybrid MPC control laws in piecewise affine form that can be directly embedded as C-code in real-time applications.Alberto Bemporadalberto.bemporad@imtlucca.it2011-07-27T09:02:47Z2011-08-04T07:29:08Zhttp://eprints.imtlucca.it/id/eprint/471This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/4712011-07-27T09:02:47ZSuboptimal Explicit Receding Horizon Control via Approximate Multiparametric Quadratic Programming Algorithms for solving multiparametric quadratic programming (MPQP) were recently proposed in Refs. 1–2 for computing explicit receding horizon control (RHC) laws for linear systems subject to linear constraints on input and state variables. The reason for this interest is that the solution to MPQP is a piecewise affine function of the state vector and thus it is easily implementable online. The main drawback of solving MPQP exactly is that, whenever the number of linear constraints involved in the optimization problem increases, the number of polyhedral cells in the piecewise affine partition of the parameter space may increase exponentially. In this paper, we address the problem of finding approximate solutions to MPQP, where the degree of approximation is arbitrary and allows to tradeoff between optimality and a smaller number of cells in the piecewise affine solution. We provide analytic formulas for bounding the errors on the optimal value and the optimizer, and for guaranteeing that the resulting suboptimal RHC law provides closed-loop stability and constraint fulfillment.Alberto Bemporadalberto.bemporad@imtlucca.itCarlo Filippi2011-07-27T09:02:45Z2011-08-05T14:03:07Zhttp://eprints.imtlucca.it/id/eprint/555This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/5552011-07-27T09:02:45ZAn efficient algorithm for computing the state feedback optimal control law for discrete time hybrid systemsFrancesco BorrelliMato BaoticAlberto Bemporadalberto.bemporad@imtlucca.itManfred Morari2011-07-27T09:02:43Z2011-08-04T07:29:08Zhttp://eprints.imtlucca.it/id/eprint/472This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/4722011-07-27T09:02:43ZMin-max control of constrained uncertain discrete-time linear systemsFor discrete-time uncertain linear systems with constraints on inputs and states, we develop an approach to determine state feedback controllers based on a min-max control formulation. Robustness is achieved against additive norm-bounded input disturbances and/or polyhedral parametric uncertainties in the state-space matrices. We show that the finite-horizon robust optimal control law is a continuous piecewise affine function of the state vector and can be calculated by solving a sequence of multiparametric linear programs. When the optimal control law is implemented in a receding horizon scheme, only a piecewise affine function needs to be evaluated on line at each time step. The technique computes the robust optimal feedback controller for a rather general class of systems with modest computational effort without needing to resort to gridding of the state-space.Alberto Bemporadalberto.bemporad@imtlucca.itFrancesco BorrelliManfred Morari2011-07-27T09:02:41Z2011-08-04T07:29:08Zhttp://eprints.imtlucca.it/id/eprint/483This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/4832011-07-27T09:02:41ZCorrigendum to: "The explicit linear quadratic regulator for constrained systems" [Automatica 38(1) (2002) 3-20]We apologize that Example 7.1 as publishedin Bemporad,
Morari, Dua, andPistikopoulos (2002) is incorrect due to a
miscalculation of the weight matrix P on the terminal stateAlberto Bemporadalberto.bemporad@imtlucca.itManfred MorariVivek DuaEfstratios N. Pistikopoulos2011-07-27T09:02:38Z2011-08-05T14:01:58Zhttp://eprints.imtlucca.it/id/eprint/557This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/5572011-07-27T09:02:38ZFurther results on multiparametric quadratic programmingIn this paper we extend results on strictly convex multiparametric quadratic programming (mpQP) to the convex case. An efficient method for computing the mpQP solution is provided. We give a fairly complete description of the mpQP solver, focusing on implementational issues such as degeneracy handling.Petter TondelTor Arne JohansenAlberto Bemporadalberto.bemporad@imtlucca.it2011-07-27T09:02:37Z2011-08-04T07:29:08Zhttp://eprints.imtlucca.it/id/eprint/559This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/5592011-07-27T09:02:37ZLogic-based hybrid solvers for optimal control of hybrid systemsCombinatorial optimization over continuous and integer variables was proposed recently as an useful tool for solving complex optimal control problems for linear hybrid dynamical systems formulated in discrete-time. Current approaches are based on mixed-integer linear/quadratic programming (MIP), which provides the solution after solving a sequence of relaxed standard linear (or quadratic) programs (LP, QP). An MIP formulation has the drawback of requiring that the discrete/logic part of the hybrid problem needs to be converted to into mixed-integer inequalities. Although this operation can be done automatically, most of the original discrete structure of the problem is lost during the conversion. Moreover, the efficiency of the MIP solver only relies upon the tightness of the continuous LP/QP relaxations. In this paper we attempt at overcoming such difficulties by combining MIP and constraint programming (CP) techniques into a "hybrid" solver, taking advantage of CP for dealing efficiently with satisfiability of logic constraints. We detail how to model the hybrid dynamics so that the optimal control problem can be solved by the hybrid MIP+CP solver, and show on a case study that the achieved performance is superior to the one achieved by pure MIP solvers.Alberto Bemporadalberto.bemporad@imtlucca.itNicolò Giorgetti2011-07-27T09:02:33Z2011-08-04T07:29:08Zhttp://eprints.imtlucca.it/id/eprint/560This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/5602011-07-27T09:02:33ZMultiparametric nonlinear integer programming and explicit quantized optimal controlThis paper deals with multiparametric nonlinear integer programming problems where the optimization variables belong to a finite set and where the cost function and the constraints depend in an arbitrary nonlinear fashion on the optimization variables and in a linear fashion on the parameters. We examine the main theoretical properties of the optimizer and of the optimum as a function of the parameters, and propose a solution algorithm. The methodology is employed to investigate properties of quantized optimal control laws and optimal performance, and to obtain their explicit representation as a function of the state vector.Alberto Bemporadalberto.bemporad@imtlucca.it2011-06-08T13:28:05Z2011-07-11T14:36:26Zhttp://eprints.imtlucca.it/id/eprint/319This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3192011-06-08T13:28:05ZNondeterministic regular expressions as solutions of equational systemsWe define the class of the linear systems whose solution is expressible as a tuple of nondeterministic regular expressions when they are interpreted as trees of actions rather than as sets of sequences. We precisely characterize those systems that have a regular expression as "canonical" solution, and show that any regular expression can be obtained as a canonical solution of a system of the defined class.Rocco De Nicolar.denicola@imtlucca.itAnna Labella2011-06-06T15:06:07Z2014-01-15T10:29:16Zhttp://eprints.imtlucca.it/id/eprint/317This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3172011-06-06T15:06:07ZThe Klaim Project: Theory and PracticeKlaim (Kernel Language for Agents Interaction and
Mobility) is an experimental language specifically designed to
program distributed systems consisting of several mobile
components that interact through multiple distributed tuple
spaces. Klaim primitives allow programmers to distribute and
retrieve data and processes to and from the nodes of a net.
Moreover, localities are first-class citizens that can be
dynamically created and communicated over the network. Components,
both stationary and mobile, can explicitly refer and control the
spatial structures of the network.
This paper reports the experiences in the design and development
of Klaim. Its main purpose is to outline the theoretical
foundations of the main features of Klaim and its programming
model. We also present a modal logic that permits reasoning about
behavioural properties of systems and various type systems that
help in controlling agents movements and actions. Extensions of
the language in the direction of object oriented programming are
also discussed together with the description of the implementation
efforts which have lead to the current prototypes. Lorenzo BettiniViviana BonoRocco De Nicolar.denicola@imtlucca.itGianLuigi FerrariDaniele GorlaMichele LoretiEugenio MoggiRosario PuglieseEmilio TuostoBetti Venneri2011-06-06T09:03:49Z2011-09-19T10:00:54Zhttp://eprints.imtlucca.it/id/eprint/323This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3232011-06-06T09:03:49ZAGILE: Software Architecture for MobilityArchitecture-based approaches have been promoted as a means of controlling the complexity of system construction and evolution, in particular for providing systems with the agility required to operate in turbulent environments and to adapt very quickly to changes in the enterprise world. Recent technological advances in communication and distribution have made mobility an additional factor of complexity, one for which current architectural concepts and techniques can be hardly used. The AGILE project is developing an architectural approach in which mobility aspects can be modelled explicitly and mapped on the distribution and communication topology made available at physical levels. The whole approach is developed over a uniform mathematical framework based on graph-oriented techniques that support sound methodological principles, formal analysis, and refinement. This paper describes the AGILE project and some of the results gained during the first project year. Luis Filipe AndradePaolo BaldanHubert BaumeisterRoberto BruniAndrea CorradiniRocco De Nicolar.denicola@imtlucca.itJose Luiz FiadeiroFabio GadducciStefania GnesiPiotr HoffmanNora KochPiotr KosiuczenkoAlessandro LapadulaDiego LatellaAntonia LopesMichele LoretiMieke MassinkFranco MazzantiUgo MontanariCristóvão OliveiraRosario PuglieseAndrzej TarleckiMichel WermelingerMartin WirsingArtur Zawlocki2011-03-01T10:03:05Z2011-07-11T14:33:43Zhttp://eprints.imtlucca.it/id/eprint/130This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/1302011-03-01T10:03:05ZSymbolic Analysis of Crypto-Protocols Based on Modular ExponentiationAutomatic methods developed so far for analysis of security protocols only model a limited set of cryptographic primitives (often, only encryption and concatenation) and from low-level features of cryptographic algorithms. This paper is an attempt towards closing this gap. We propose a symbolic technique and a decision method for analysis of protocols based on modular exponentiation, such as Diffie-Hellman key exchange. We introduce a protocol description language along with its semantics. Then, we propose a notion of symbolic execution and, based on it, a verification method. We prove that the method is sound and complete with respect to the language semantics.Michele BorealeMaria Grazia Buscemim.buscemi@imtlucca.it