On the nature of events: another perspective in concurrency

Pinna, G.; Poigné, Axel

doi:10.1016/0304-3975(94)00174-h

Cited by 49 publications

(27 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A notable exclusion is event automata in [31], i.e., tuples (E, C, →, I) with → a given transition relation over configurations (states), and I ∈ C an initial state.…”

Section: Feature Vs Event-based Concurrency Modelingmentioning

confidence: 99%

Faithful Modeling of Product Lines with Kripke Structures and Modal Logic

Diskin¹,

Safilian²,

Maibaum³

et al. 2016

SACS

View full text Add to dashboard Cite

Software product lines are now an established framework for software design. They are specified by special diagrams called feature models. For formal analysis, the latter are usually encoded by Boolean propositional theories. We discuss a major deficiency of this semantics, and show that it can be fixed by considering a product to be an instantiation process rather than its final result. We call intermediate states of this process partial products, and argue that what a feature model really defines is a poset of its partial products. We argue that such structures can be viewed as special Kripke structure that we call partial product Kripke structures, ppKS. To specify these Kripke structures, we propose a CTL-based logic, called partial product CTL, ppCTL. We show how to represent a feature model M by a ppCTL theory ML(M ) (ML stands for modal logic) such that any ppKS satisfying the theory is equal to the partial product line determined by M . Hence, ML(M ) can be considered a sound and complete representation of M . We also discuss several applications of the modal logic view in feature modeling, including refactoring of feature models.

show abstract

“…A notable exclusion is event automata in [31], i.e., tuples (E, C, →, I) with → a given transition relation over configurations (states), and I ∈ C an initial state.…”

Section: Feature Vs Event-based Concurrency Modelingmentioning

confidence: 99%

Faithful Modeling of Product Lines with Kripke Structures and Modal Logic

Diskin¹,

Safilian²,

Maibaum³

et al. 2016

SACS

View full text Add to dashboard Cite

show abstract

“…It can be easily seen that IES's properly generalise prime [41], asymmetric [6], (extended) bundle event structures [25] and prime event structures with possible events [35]. Instead IES's and flow event structures [7] (with possible flow [35]), although strictly related, are, in a sense, not comparable since there are IES's whose sets of configurations cannot be described by a flow event structure and vice versa.…”

Section: Ies Ementioning

confidence: 99%

“…More generally, it is possible to show that the category of asymmetric event structures introduced in [6] fully embeds into IES (see [4]). Also (extended) bundle event structures [25] and prime event structures with possible events [35] can be seen as special classes of IES's. As we will discuss later, the categorical treatment of IES's and the results relating IES's and domains specialises to such event structure models.…”

Section: Proposition 33mentioning

confidence: 99%

Domain and event structure semantics for Petri nets with read and inhibitor arcs*1

Baldan

2004

Theoretical Computer Science

View full text Add to dashboard Cite

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 by Winskel on safe (ordinary) nets, the truly concurrent semantics is given at a categorical level via a chain of coreflections leading from the category SW-IN of semi-weighted inhibitor nets to the category Dom of finitary prime algebraic domains (equivalent to the category PES of prime event structures). As an intermediate semantic model, we introduce inhibitor event structures, an event based model able to faithfully capture the dependencies among events which arise in the presence of read and inhibitor arcs. Inhibitor event structures generalise several event structure models in the literature, like prime, asymmetric and bundle event structures.

show abstract

“…The paradigmatic case is when transition t ′ consumes a token in the context of t, i.e., when t∩ • t ′ = ∅, as for transitions t ′ 1 and t ′ 2 in Fig. 2(b) (see [13,9,14]). …”

Section: Occurrence C-netsmentioning

confidence: 99%

On the Computation of McMillan’s Prefix for Contextual Nets and Graph Grammars

Baldan

Bruni

Corradini

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for constructing a finite complete prefix of the unfolding of a safe Petri net, providing a compact representation of the reachability graph. The extension to contextual nets and graph transformation systems is far from being trivial because events can have multiple causal histories. Recently, we proposed an abstract algorithm that generalizes McMillan's construction to bounded contextual nets without resorting to an encoding into plain P/T nets. Here, we provide a more explicit construction that renders the algorithm effective. To allow for an inductive definition of concurrency, missing in the original proposal and essential for an efficient unfolding procedure, the key intuition is to associate histories not only with events, but also with places. Additionally, we outline how the proposed algorithm can be extended to graph transformation systems, for which previous algorithms based on the encoding of read arcs would not be applicable.

show abstract

On the nature of events: another perspective in concurrency

Cited by 49 publications

References 6 publications

Faithful Modeling of Product Lines with Kripke Structures and Modal Logic

Faithful Modeling of Product Lines with Kripke Structures and Modal Logic

Domain and event structure semantics for Petri nets with read and inhibitor arcs*1

On the Computation of McMillan’s Prefix for Contextual Nets and Graph Grammars

Contact Info

Product

Resources

About