1,773 research outputs found
Network-Conscious π-calculus – A Model of Pastry
No full textAbstractA peer-to-peer (p2p) system provides the networking substrate for the execution of distributed applications. It is made of peers that interact over an overlay network. Overlay networks are highly dynamic, as peers can join and leave at any time. Traditional process calculi, such as π-calculus, CCS and others, seem inadequate to capture these kinds of networks, their routing mechanisms, and to verify their properties. In order to model network architecture in a more explicit way, in [Ugo Montanari and Matteo Sammartino. Network conscious π-calculus: A concurrent semantics. ENTCS, 286:291–306, 2012; Matteo Sammartino. A Network-Aware Process Calculus for Global Computing and its Categorical Framework. PhD thesis, University of Pisa, 2013. available at http://www.di.unipi.it/~sammarti/publications/thesis.pdf; Ugo Montanari and Matteo Sammartino. A network-conscious π-calculus and its coalgebraic semantics. Theor. Comput. Sci., 546:188–224, 2014] we have introduced the Network Conscious π-calculus (NCPi), an extension of the π-calculus with names representing network nodes and links. In [Ugo Montanari and Matteo Sammartino. A network–conscious π-calculus and its coalgebraic semantics. Theor. Comput. Sci., 546:188–224, 2014] (a simpler version of) NCPi has been equipped with a coalgebraic operational models, along the lines of Fiore-Turi presheaf-based approach [Marcelo P. Fiore and Daniele Turi. Semantics of name and value passing. In LICS 2001, pages 93–104. IEEE Computer Society, 2001], and with an equivalent History Dependent Automaton [Ugo Montanari and Marco Pistore. Structured coalgebras and minimal hd-automata for the π-calculus. Theor. Comput. Sci., 340(3):539–576, 2005], i.e., an (often) finite-state automaton suitable for verification. In this paper we first give a brief account of these results. Then, our contribution is the sketch of a NCPi representation of the p2p architecture Pastry. In particular, we give models of its overlay network and of a Distributed Hash Table built on top of it, and we give evidence of their correctness by proving convergence of routing mechanisms
Residual Nominal Automata
No full textWe are motivated by the following question: which nominal languages admit an active learning algorithm? This question was left open in previous work, and is particularly challenging for languages recognised by nondeterministic automata. To answer it, we develop the theory of residual nominal automata, a subclass of nondeterministic nominal automata. We prove that this class has canonical representatives, which can always be constructed via a finite number of observations. This property enables active learning algorithms, and makes up for the fact that residuality - a semantic property - is undecidable for nominal automata. Our construction for canonical residual automata is based on a machine-independent characterisation of residual languages, for which we develop new results in nominal lattice theory. Studying residuality in the context of nominal languages is a step towards a better understanding of learnability of automata with some sort of nondeterminism
Medical therapy for heart failure with preserved ejection fraction: Still a minefield, but with new hope
No full text
Generators and Bases for Monadic Closures
No full textIt is well-known that every regular language admits a unique minimal deterministic acceptor. Establishing an analogous result for non-deterministic acceptors is significantly more difficult, but nonetheless of great practical importance. To tackle this issue, a number of sub-classes of non-deterministic automata have been identified, all admitting canonical minimal representatives. In previous work, we have shown that such representatives can be recovered categorically in two steps. First, one constructs the minimal bialgebra accepting a given regular language, by closing the minimal coalgebra with additional algebraic structure over a monad. Second, one identifies canonical generators for the algebraic part of the bialgebra, to derive an equivalent coalgebra with side effects in a monad. In this paper, we further develop the general theory underlying these two steps. On the one hand, we show that deriving a minimal bialgebra from a minimal coalgebra can be realized by applying a monad on an appropriate category of subobjects. On the other hand, we explore the abstract theory of generators and bases for algebras over a monad
TUTELA DEL LAVORO E LIBERTA' D'IMPRESA NEI PROCESSI DI ESTERNALIZZAZIONE
No full textL’elaborato analizza le conseguenze lavoristiche della successione fra imprenditori, muovendo da una ricognizione delle varie tipologie di esternalizzazione con le relative esigenze e principali criticità.
L’indagine si concentra in primo luogo sul trasferimento d’azienda, esaminando la normativa e la giurisprudenza europee per passare poi alla disciplina di diritto interno, alle procedure sindacali e a uno specifico focus sul trasferimento delle aziende in crisi.
Successivamente l’autore si sofferma sull’appalto, prendendone in particolare considerazione gli indici di genuinità, i criteri di distinzione dalla somministrazione illecita di manodopera e la tutela delle maestranze in caso di avvicendamento fra imprese.
Da ultimo, la ricerca approfondisce le c.d. “clausole sociali”, sia di prima che di seconda generazione, valutandone la compatibilità con il diritto eurounitario e con la costituzione nonché riflettendo sui possibili rimedi in caso di loro violazione.The author analyzes the labour consequences of the succession between entrepreneurs, starting from a recognition of the various types of outsourcing with the related needs and main critical issues.
The survey focuses primarily on the transfer of businesses, examining European legislation and case-law and then moving on to internal legislation, trade union procedures and a specific focus on the transfer of companies in crisis.
The author then dwells on the contract, taking into account in particular the indications of authenticity, the criteria of distinction from the illicit administration of labour and the protection of workers in the event of turnover between companies.
Finally, the research deepens the "social clauses", both first and second generation, assessing their compatibility with European law and with the constitution and reflecting on possible remedies in case of their violation
A coalgebraic semantics for causality in Petri nets
No full textContains fulltext :
151222.pdf (Author’s version preprint ) (Open Access
Residuality and Learning for Nondeterministic Nominal Automata
No full textWe are motivated by the following question: which data languages admit an
active learning algorithm? This question was left open in previous work by the
authors, and is particularly challenging for languages recognised by
nondeterministic automata. To answer it, we develop the theory of residual
nominal automata, a subclass of nondeterministic nominal automata. We prove
that this class has canonical representatives, which can always be constructed
via a finite number of observations. This property enables active learning
algorithms, and makes up for the fact that residuality -- a semantic property
-- is undecidable for nominal automata. Our construction for canonical residual
automata is based on a machine-independent characterisation of residual
languages, for which we develop new results in nominal lattice theory. Studying
residuality in the context of nominal languages is a step towards a better
understanding of learnability of automata with some sort of nondeterminism
Ultra Low Carbon Vehicles: New Parameters for Automotive Design
No full textAs the influence of vehicle emissions on our environment has become better understood, the UK government has recently placed urgent emphasis on the implementation of low carbon
technologies in the automotive industry through: the UK Low Carbon Industrial Strategy. The overall objective is to offer big incentives to consumers and support for the development of infrastructure and engineering solutions. This scheme however does not consider how the development of functional and experiential user value might drive consumer demand, contributing to the adoption of low carbon vehicles (LCVs) in the mass market.
With the emergence of the North East of England as the UK’s first specialised region for the development of ultra-low carbon vehicles (ULCVs), ONE North East, as a development agency for the region's economic and business development, and Northumbria University Ideas-lab have supported a project to facilitate innovation through the collaboration of technology, research and development (R&D) and business. The High Value Low Carbon (HVLC) project aims to envisage
new user value made possible by the integration of low carbon vehicle platforms with new process and network technologies. The HVLC consortium represents vehicle manufacturers and their suppliers as well as technology based companies and through an ongoing process of design concept generation the project offers a hub for innovation led enterprise.
Whilst new technological developments in areas such as power generation, nano materials, hydrogen fuel cells, printed electronics and networked communications will all impact on future automotive design, the mass adoption of low carbon technologies represents a paradigm shift for the motorist. This paper aims to describe how the mapping of new parameters will lead to new transport scenarios that will create the space for new collaborative research on user experiences supported by innovative technologies and related services
- …
