IMT Institutional Repository: No conditions. Results ordered -Date Deposited. 2019-06-17T00:58:48ZEPrintshttp://eprints.imtlucca.it/images/logowhite.pnghttp://eprints.imtlucca.it/2016-04-20T09:22:05Z2016-04-20T09:22:05Zhttp://eprints.imtlucca.it/id/eprint/3464This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/34642016-04-20T09:22:05ZValutazione dell’attività monoamino-ossidasica trombocitaria in pazienti con Dipendenza da AlcolPietro Pietrinipietro.pietrini@imtlucca.itPaolo BongioanniGabriella ScarpelliniFederica LoprienoMario Guazzelli2011-09-15T09:26:55Z2014-12-02T09:50:36Zhttp://eprints.imtlucca.it/id/eprint/886This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/8862011-09-15T09:26:55ZParigi 1904: Picasso iberico e Les Demoiselles d’AvignonMaria Luisa Catonimarialuisa.catoni@imtlucca.it2011-06-16T07:49:09Z2011-07-11T14:36:27Zhttp://eprints.imtlucca.it/id/eprint/378This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3782011-06-16T07:49:09ZThree Logics for Branching Bisimulation (Extended Abstract)Rocco De Nicolar.denicola@imtlucca.itFrits W. Vaandrager2011-06-14T10:29:06Z2011-07-11T14:36:27Zhttp://eprints.imtlucca.it/id/eprint/381This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3812011-06-14T10:29:06ZUsing the Adxiomatic Presentation of Behavioural Equivalences for Manipulating CCS SpecificationsAn interactive system for proving properties of CCS specifications is described. This system allows users to take advantage of all three views of CCS semantics (the transitions, the operationally defined equivalences and the axioms) and to define their own verification strategies for moving from one view to another. The system relies on term rewriting techniques and manipulates only the symbolic representation of specifications without resorting to any other kind of internal representation.Rocco De Nicolar.denicola@imtlucca.itPaola InverardiMonica Nesi2011-06-13T09:04:16Z2014-01-15T10:33:06Zhttp://eprints.imtlucca.it/id/eprint/377This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3772011-06-13T09:04:16ZObservational Logics and Concurrency ModelsThe aim of this paper is to examine some basic topics of true concurrency from the viewpoint of program logics. In particular, logical characterizations of observational (bisimulation) equivalences based on partial ordering observations are studied. To date, in contrast with the interleaving approach, such equivalences have been almost exclusively studied from the operational standpoint. We shall show that they can be defined in a logical setting and that standard modal and temporal techniques can also be applied to true concurrency models. As a result, the interleaving and the partial ordering views of concurrency are reconciled within a logical setting.Rocco De Nicolar.denicola@imtlucca.itGianLuigi Ferrari2011-06-10T14:15:52Z2011-07-11T14:36:27Zhttp://eprints.imtlucca.it/id/eprint/380This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3802011-06-10T14:15:52ZA Partial Ordering Semantics for CCSA new operational semantics for “pure” CCS is proposed that considers the parallel operator as a first class one, and permits a description of the calculus in terms of partial orderings. The new semantics (also for unguarded agents) is given in the SOS style via the partial ordering derivation relation. CCS agents are decomposed into sets of sequential subagents. The new derivations relate sets of subagents, and describe their actions and the casual dependencies among them. The computations obtained by composing partial ordering derivations are “observed” either as interleaving or partial orderings of events. Interleavings coincide with Milner's many step derivations, and “linearizations” of partial orderings are all and only interleavings. Abstract semantics are obtained by introducing two relations of observational equivalence and congruence that preserve concurrency. These relations are finer than Milner's in that they distinguish interleaving of sequential nondeterministic agents from their concurrent execution.Pierpaolo DeganoRocco De Nicolar.denicola@imtlucca.itUgo Montanari2011-06-10T12:33:03Z2011-07-11T14:36:27Zhttp://eprints.imtlucca.it/id/eprint/376This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3762011-06-10T12:33:03ZBack and Forth BisimulationsThis paper is concerned with bisimulation relations which do not only require related agents to simulate each others behavior in the direction of the arrows, but also to simulate each other when going back in history. First it is demonstrated that the back and forth variant of strong bisimulation leads to the same equivalence as the ordinary notion of strong bisimulation. Then it is shown that the back and forth variant of Milner's observation equivalence is different from (and finer than) observation equivalence. In fact we prove that it coincides with the branching bisimulation equivalence of Van Glabbeek & Weijland. Also the back and forth variants of branching, eegr and delay bisimulation lead to branching bisimulation equivalence. The notion of back and forth bisimulation moreover leads to characterizations of branching bisimulation in terms of abstraction homomorphisms and in terms of Hennessy-Milner logic with backward modalities. In our view these results support the claim that branching bisimulation is a natural and important notion.Rocco De Nicolar.denicola@imtlucca.itUgo MontanariFrits W. Vaandrager2011-05-31T12:27:28Z2011-07-11T14:36:27Zhttp://eprints.imtlucca.it/id/eprint/379This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3792011-05-31T12:27:28ZAction versus State based Logics for Transition SystemsA temporal logic based on actions rather than on states is presented and interpreted over labelled transition systems. It is proved that it has essentially the same power as CTL*, a temporal logic interpreted over Kripke structures. The relationship between the two logics is established by introducing two mappings from Kripke structures to labelled transition systems and viceversa and two transformation functions between the two logics which preserve truth. A branching time version of the action based logic is also introduced. This new logic for transition systems can play an important role as an intermediate between Hennessy-Milner Logic and the modal μ-calculus. It is sufficiently expressive to describe safety and liveness properties but permits model checking in linear time.Rocco De Nicolar.denicola@imtlucca.itFrits W. Vaandrager