L. Pomello - Academia.edu (original) (raw)

Papers by L. Pomello

Lecture Notes in Computer Science, 2013

These are the proceedings of the International Workshop on Petri Nets and Software Engineering (P... more These are the proceedings of the International Workshop on Petri Nets and Software Engineering (PNSE'13) in Milano, Italy, June 24-25, 2013. It is a co-located event of Petri Nets 2013, the 34th international conference on Applications and Theory of Petri Nets and Concurrency. More information about the workshop can be found at http://www.informatik.uni-hamburg.de/TGI/events/pnse13/ For the successful realisation of complex systems of interacting and reactive software and hardware components the use of a precise language at different stages of the development process is of crucial importance. Petri nets are becoming increasingly popular in this area, as they provide a uniform language supporting the tasks of modelling, validation, and verification. Their popularity is due to the fact that Petri nets capture fundamental aspects of causality, concurrency and choice in a natural and mathematically precise way without compromising readability. The use of Petri Nets (P/T-Nets, Coloured Petri Nets and extensions) in the formal process of software engineering, covering modelling, validation, and verification, will be presented as well as their application and tools supporting the disciplines mentioned above.

ABSTRACT The capability of representing in an highly communicable way the concurrency among auton... more ABSTRACT The capability of representing in an highly communicable way the concurrency among autonomous subsystems is frequently crucial in real systems modelling, whichever the nature of the system can be.

Lecture Notes in Computer Science, 1990

The paper presents a notion of preorder with related equivalence between concurrent systems which... more The paper presents a notion of preorder with related equivalence between concurrent systems which supports functional abstraction and refinement. Such abstraction and refinement disregard action names (the action alphabet can be changed) while they require to preserve local state transformations. Since Petri Nets explicitly model both states and state transformations, concurrent systems are considered as modelled by Petri nets, precisely

Concurrency and Nets, 1987

Informatik-Fachberichte, 1983

Lecture Notes in Computer Science, 2014

Lecture Notes in Computer Science, 1997

... Science, Florence, 1995. [Fer96] C. Ferigato, Note su a]ctme Propriet£ Algebriche, Logiche, T... more ... Science, Florence, 1995. [Fer96] C. Ferigato, Note su a]ctme Propriet£ Algebriche, Logiche, Topologiche della Concorrenza, Tesi di Dottorato di Ricerca in Informatica, Universit~ degli Stud] eli Milano, 1996. [ER90] A. Ehrenfeueht ...

Lecture Notes in Computer Science, 1992

ABSTRACT This paper surveys various notions of equivalence for concurrent systems in the framewor... more ABSTRACT This paper surveys various notions of equivalence for concurrent systems in the framework of Elementary Net Systems, a fundamental class in the family of Petri Net models. Two types of equivalences are considered: equivalences based on observations of ...

Lecture Notes in Computer Science, 2004

Synthesis and Control of Discrete Event Systems, 2002

Electronic Proceedings in Theoretical Computer Science, 2014

ABSTRACT We start from two closure operators defined on the elements of a special kind of partial... more ABSTRACT We start from two closure operators defined on the elements of a special kind of partially ordered sets, called causal nets. Causal nets are used to model histories of concurrent processes, recording occurrences of local states and of events. If every maximal chain (line) of such a partially ordered set meets every maximal antichain (cut), then the two closure operators coincide, and generate a complete orthomodular lattice. In this paper we recall that, for any closed set in this lattice, every line meets either it or its orthocomplement in the lattice, and show that to any line, a two-valued state on the lattice can be associated. Starting from this result, we delineate a logical language whose formulas are interpreted over closed sets of a causal net, where every line induces an assignment of truth values to formulas. The resulting logic is non-classical; we show that maximal antichains in a causal net are associated to Boolean (hence "classical") substructures of the overall quantum logic.

Lecture Notes in Computer Science, 2009

In this paper, we study partially ordered structures associated to occurrence nets. An occurrence... more In this paper, we study partially ordered structures associated to occurrence nets. An occurrence net is endowed with a symmetric, but in general non transitive, concurrency relation. By applying known techniques in lattice theory, from any such relation one can derive a closure operator, and then an orthocomplemented lattice. We prove that, for a general class of occurrence nets, those