Search results for: G. Michele

Items from 1 to 20 out of 30 results

article

Introducing new design spectra derived from Italian recorded ground motions 1972 to 2017

G. Michele Calvi, Daniela Rodrigues, Vitor Silva

Earthquake Engineering & Structural Dynamics > 47 > 13 > 2644 - 2660

The shape of design spectra, traditionally based on regions characterized by constant displacement, constant velocity, and constant acceleration, has been discussed from a conceptual point of view by Calvi (2018). In the same study, a formulation for the definition of the design spectra relying on four parameters was proposed. Predictive models are proposed herein to calculate these four parameters,...

chapter

Coordination of Synchronous Programs

Reinhard Budde, G. Michele Pinna, Axel Poigné

Lecture Notes in Computer Science > Coordinatio Languages and Models > Regular Papers > 103-117

We propose to extend the synchronous language Esterel by coordination primitives and by an asynchronous parallel composition operation on the level of modules. This is to program reactive systems such that subsystems may proceed at their own speed without enforcing a global knowledge of time. We intend is to stick with the synchronous language paradigm as close as possible since we aim for properties...

chapter

Synthesis of nets with inhibitor arcs

Nadia Busi, G. Michele Pinna

Lecture Notes in Computer Science > CONCUR '97: Concurrency Theory > 151-165

The synthesis problem for Petri nets consists in the construction of a net system whose behaviour is specified by a given transition system. In this paper we deal with the synthesis of elementary net systems extended with inhibitor arcs, i.e. arcs that test for absence of tokens in a place. We characterize the class of transitions systems corresponding to the sequential execution of these nets, which...

chapter

Functional Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs

Paolo Baldan, Nadia Busi, Andrea Corradini, G. Michele Pinna

Lecture Notes in Computer Science > CONCUR 2000 — Concurrency Theory > Accepted Papers > 442-457

We propose a functorial concurrent semantics for Petri nets extended with read and inhibitor arcs, that we call inhibitor nets. Along the lines of the seminal work of Winskel on safe nets, the truly concurrent semantics is given at a categorical level via a chain of functors leading from the category SW-IN of semi-weighted inhibitor nets to the category Dom of finitary prime algebraic domains. As...

chapter

Verifying a time-triggered protocol in a multi-language environment

Agathe Merceron, Monika Müllerburg, G. Michele Pinna

Lecture Notes in Computer Science > Computer Safety, Reliability and Security > Formal Methods II - Languages and Verification > 185-195

The multi-language environment Synchronie supports the design and formal verification of synchronous reactive systems. Presently, Synchronie integrates three synchronous languages, Esterel, Lustre, and Argos. In the synchronous approach, not only the system but also its properties can be specified using a synchronous language. In Synchronie properties can be formalised textually as Esterel or Lustre...

chapter

How Much Is Worth to Remember? A Taxonomy Based on Petri Nets Unfoldings

G. Michele Pinna

Lecture Notes in Computer Science > Applications and Theory of Petri Nets > Regular Papers > 109-128

The notion of unfolding plays a major role in the so called non sequential semantics of Petri nets, as well as in model checking of concurrent and distributed systems or in control theory. In literature various approaches to this notion have been proposed, where dependencies among events are represented either taking into account the whole history of the event (the so called individual token philosophy...

chapter

Simultaneity in Event Structures

G. Michele Pinna, Andrea Saba

Lecture Notes in Computer Science > Theory and Applications of Models of Computation > Contributed Papers > 385-396

Various brand of event structures, prime, bundle, flow, asymmetric, inhibitor just to mention some, have been proposed to face the various kinds of causality and conflict arising in computation. The notion of simultaneity, i.e., the faithful representation that certain events have to occur together, is usually left out from the models for concurrent computations, with some notably exceptions like...

chapter

Event automata as a generic model of reactive systems

G. Michele Pinna, Axel Poigné

Lecture Notes in Computer Science > KORSO: Methods, Languages, and Tools for the Construction of Correct Software > 74-91

Event automata are a generic model of event-based computations of reactive systems. The paper gives an overview of the rationale of the concept, sketches the underlying mathematics, and provides some ideas about appropriate specification techniques. The framework will be instantiated by various, conceptually quite different examples ranging from interleaving semantics and process calculi to true concurrency...

chapter

Event Structures for the Collective Tokens Philosophy of Inhibitor Nets

G. Michele Pinna

Lecture Notes in Computer Science > Mathematical Foundations of Computer Science 2005 > Papers > 720-732

In recent years the collective tokens philosophy for Petri Nets has gained again the stage, but it is commonly set in opposition to the individual tokens philosophy. In this paper we investigate what can be an adequate event structures to capture the collective tokens philosophy of nets when inhibitor arcs are taken into account.

chapter

On the specification of elementary reactive behaviour

G. Michele Pinna, Axel Poigné

Lecture Notes in Computer Science > Mathematical Foundations of Programming Semantics > 271-292

The paper addresses the specification of reactive behaviour for event-based models. We are concerned with a framework for such specification rather than with a particular style of specifications. Our main observation is that a logic of events is needed as well as a logic of actions. The former prescribes in fine detail how computations proceed while the latter provides generic scripts for events to...

chapter

On the nature of events

G. Michele Pinna, Axel Poigné

Lecture Notes in Computer Science > Mathematical Foundations of Computer Science 1992 > 430-441

We introduce yet another event-based formalism, event automata, which unifies various definitions to be found in the literature. Moreover we discuss various new concepts such as possible events, asymmetric conflict and quiescent states. We also distinguish between specifications and automata which satisfy a specification.

book

Theoretical Computer Science

Mario Coppo, Elena Lodi, G. Michele Pinna

Lecture Notes in Computer Science

article

Contracts as games on event structures

Massimo Bartoletti, Tiziana Cimoli, G. Michele Pinna, Roberto Zunino

Journal of Logical and Algebraic Methods in Programming > 2016 > 85 > 3 > 399-424

Event structures are one of the classical models of concurrent systems. The idea is that an enabling X⊢e represents the fact that the event e can only occur after all the events in the set X have already occurred. By interpreting events as actions promised by some participants, and by associating each participant with a goal (a function on sequences of events), we use event structures as a formal...

article

Lending Petri nets

Massimo Bartoletti, Tiziana Cimoli, G. Michele Pinna

Science of Computer Programming > 2015 > 112 > P1 > 75-101

We study Lending Petri nets, an extension of Petri nets where places may carry a negative number of tokens. This allows for modeling contracts where a participant may promise to give some of her resources under the guarantee that some other resources will eventually be obtained in exchange. We then propose an interpretation of the Horn fragment of Propositional Contract Logic in Lending Petri nets...

article

Catalytic and communicating Petri nets are Turing complete

Gabriel Ciobanu, G. Michele Pinna

Information and Computation > 2014 > 239 > Complete > 55-70

In most studies about the expressiveness of Petri nets, the focus has been put either on adding suitable arcs or on assuring that a complete snapshot of the system can be obtained. While the former still complies with the intuition on Petri nets, the second is somehow an orthogonal approach, as Petri nets are distributed in nature. Here, inspired by membrane computing, we study some classes of Petri...

article

Insulin‐like growth factor‐1 predicts cognitive functions at 2‐year follow‐up in early, drug‐naïve Parkinson's disease

M. T. Pellecchia, G. Santangelo, M. Picillo, R. Pivonello, more

European Journal of Neurology > 21 > 5 > 802 - 807

Background and purposeCognitive impairment is common in Parkinson's disease (PD), even in the early stages. We aimed to assess the relationship between insulin‐like growth factor‐1 (IGF‐1) and cognitive functions in early, drug‐naïve patients with PD. MethodsSerum IGF‐1 was measured in 65 early, drug‐naïve patients with PD that underwent a complete neuropsychological battery at baseline and after...

chapter

Timed Catalytic Petri Nets

Bogdan Aman, Gabriel Ciobanu, G. Michele Pinna

2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing > 319 - 326

2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

We consider catalytic membrane systems ($CatMS$) and catalytic Petri nets ($CatPN$). We add discrete timers to these classes, and prove that the timed formalisms ($tCatMS$ and $tCatPN$) can be expressed by their untimed versions if finite timers are used. We establish formal links between these formalisms, and characterize some subclasses in which various properties are decidable and can be analyzed...

article

Modeling dependencies and simultaneity in membrane system computations

G. Michele Pinna, Andrea Saba

Theoretical Computer Science > 2012 > 431 > Complete > 13-39

Membrane system computations proceed in a synchronous fashion: at each step all the applicable rules are actually applied. Hence each step depends on the previous one. This coarse view can be refined by looking at the dependencies among rule occurrences, by recording, for an object in a membrane and at a certain stage of the computation, which were the rules that produced it and subsequently (in a...

article

ERK1 nucleocytoplasmic shuttling rate depends on specific N-terminal aminoacids

Matilde Marchi, Laura Pancrazi, Margherita Maffei, G. Michele Ratto, more

Biochemical and Biophysical Research Communications > 2010 > 398 > 2 > 166-172

Despite ERK1 and ERK2 were considered interchangeable isoforms for a long time, their roles are now emerging as only partially overlapping. We recently reported that the nucleocytoplasmic trafficking of GFP-tagged ERK1 is slower than that of ERK2, this difference being caused by a unique domain of ERK1 located at its N-terminus (ERK1-Nt). In the present report we further investigated this issue by...

article

Low-dose idebenone treatment in Friedreich’s ataxia with and without cardiac hypertrophy

C. Rinaldi, T. Tucci, S. Maione, A. Giunta, more

Journal of Neurology > 2009 > 256 > 9 > 1434-1437

Left ventricular hypertrophy (LVH) is a frequent finding in Friedreich’s ataxia (FRDA). In previous studies treatment with idebenone, a synthetic analogue of coenzyme Q10, has been associated with a substantial decrease in myocardial hypertrophy, despite great variability in cardiac responsiveness among patients. Here we present the results of a retrospective analysis of a cohort of 35 patients (20...

Publication date

Set your own date range

Content availability

Available (28)
None (2)

Publication type

article (17)
book (13)

Keywords

Data set

Springer (18)
Elsevier (8)
ieee (2)
Wiley (2)

Journal

Journal of Neurology (4)
Theoretical Computer Science (2)
Archives of Virology (1)
Biochemical and Biophysical Research Communications (1)
Clinical Rheumatology (1)
Earthquake Engineering & Structural Dynamics (1)
Electronic Notes in Theoretical Computer Science (1)
European Journal of Neurology (1)
Fuzzy Sets and Systems (1)
Information and Computation (1)
Journal of Logical and Algebraic Methods in Programming (1)
Science of Computer Programming (1)
Theory of Computing Systems (1)
more

INFONA - science communication portal

Search results for: G. Michele

Introducing new design spectra derived from Italian recorded ground motions 1972 to 2017

Coordination of Synchronous Programs

Synthesis of nets with inhibitor arcs

Functional Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs

Verifying a time-triggered protocol in a multi-language environment

How Much Is Worth to Remember? A Taxonomy Based on Petri Nets Unfoldings

Simultaneity in Event Structures

Event automata as a generic model of reactive systems

Event Structures for the Collective Tokens Philosophy of Inhibitor Nets

On the specification of elementary reactive behaviour

On the nature of events

Theoretical Computer Science

Contracts as games on event structures

Lending Petri nets

Catalytic and communicating Petri nets are Turing complete

Insulin‐like growth factor‐1 predicts cognitive functions at 2‐year follow‐up in early, drug‐naïve Parkinson's disease

Timed Catalytic Petri Nets

Modeling dependencies and simultaneity in membrane system computations

ERK1 nucleocytoplasmic shuttling rate depends on specific N-terminal aminoacids

Low-dose idebenone treatment in Friedreich’s ataxia with and without cardiac hypertrophy

Filter options

Publication date

Content availability

Publication type

Keywords

Data set

Journal

INFONA - science communication portal

Search results for: G. Michele

Add recipient

Sending message cancelled

Are you sure you want to cancel sending this message?

Send message

Filter options

Publication date

Date range setting

Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.

Content availability

Publication type

Keywords

Data set

Journal

Reporting an error / abuse

Sending the report failed

Accessibility options