Wyniki wyszukiwania - BazTech

Ograniczanie wyników

4 Fundamenta Informaticae

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 4

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Circular Causality in Event Structures

Bartoletti M., Cimoli T., Pinna G. M., Zunino R.

Fundamenta Informaticae

2014

Vol. 134, nr 3/4

219--259

We propose a model of events with circular causality, in the form of a conservative extension of Winskel’s event structures. We study the relations between this new kind of event structures and Propositional Contract Logic. Provable atoms in the logic correspond to reachable events in our event structures. Furthermore, we show a correspondence between the configurations of this new brand of event structures and the proofs in a fragment of Propositional Contract Logic.

Event Structures with Disabling/Enabling Relation and Event Automata

Pinna G.M.

Fundamenta Informaticae

2006

Vol. 73, nr 3

409-430

In recent years the consideration that events in evolutions of concurrent systems can happen with different histories has received ground. In particular the possibility that part of the history can be abstracted away or identified, like in the collective tokens philosophy for Petri Nets, has gained the stage. The various brands of event structures considered in literature are tailored to a fixed interpretation with respect to the history of an event. We investigate the adequateness of event structures with a disabling/enabling relation, to settle a common ground for the history dependent and history independent interpretations, and we establish a relationship between event automata and these notions of event structures.

Comparing truly concurrent semantics for contextual Place/Transition nets with inhibitor and read arcs

Busi N., Pinna G.M.

Fundamenta Informaticae

2000

Vol. 44, Nr 3

209-244

The paper is centered around the study and comparison of truly concurrent semantics for P/T nets with inhibitor and read arcs (called henceforth contextual P/T nets). We start proposing a causal semantics for P/T nets, that we prove to be equivalent to history preserving bisimulation defined on nonsequential processes. Then we develop a conservative extension of the causal semantics to contextual P/T nets and we prove this one to be finer than step semantics. Finally, a comparison of causal semantics with the process based semantics for contextual P/T systems proposed in [7] is carried out.

Process semantics for Place/Transition nets with inhibitor and read arcs

Busi N., Pinna G.M.

Fundamenta Informaticae

1999

Vol. 40, Nr 2,3

165-197

In this paper we introduce a truly concurrent semantics for P/T nets with inhibitor and read arcs, called henceforth Contextual P/T nets. The semantics is based on a proper extension of the notion of process to cope with read and inhibitor arcs: we show that most of the properties enjoined by the classical process semantics for P/T nets continue to hold and we substantiate the adequateness of our notion by comparing it with the step semantics.