Parallel program schemata

Karp, Richard M.; Miller, Raymond E.

doi:10.1016/s0022-0000(69)80011-5

Cited by 798 publications

(367 citation statements)

References 5 publications

Supporting

Mentioning

350

Contrasting

Unclassified

Order By: Relevance

“…They introduced three semantic quality attributes for the semantics of events, therefore they only needed to deal with one semantic aspect and not cross-cutting concerns. Similar semantic properties to our semantic quality attributes have been considered in primitive formalisms [5,14,15,16,19], which are models of computations rather than practical languages. These e«orts characterize a class of models that satisfy a property whereas we determine the set of BSML semantics that satisfy each semantic quality attribute.…”

Section: Introductionmentioning

confidence: 92%

Semantic Quality Attributes for Big-Step Modelling Languages

Esmaeilsabzali

Day

2011

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract.A semantic quality attribute of a modelling language is a desired semantic characteristic that is common to all models specified in that language. A modeller can enjoy the luxury of not having to model the invariants of the behaviour that are implicitly enforced by the semantic quality attributes. In this paper, we introduce three semantic quality attributes for the family of big-step modelling languages (BSMLs). In a BSML, a model's reaction to an environmental input is a sequence of small steps, each of which can consist of the execution of a set of transitions from multiple concurrent components. Each of our three semantic quality attributes specifies a desired property about how the sequence of small steps form a big step. We systematically enumerate the range of BSML semantics that satisfy each semantic quality attribute.

show abstract

Section: Introductionmentioning

confidence: 92%

Semantic Quality Attributes for Big-Step Modelling Languages

Esmaeilsabzali

Day

2011

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

show abstract

“…Given that a preplace p of a Petri net transition can also be a postplace of the same or another transition, this or these transitions may at the same time remove and insert tokens at p. As a consequence such updates are what in the ASM framework are called cumulative updates, a special vector addition [54] kind of partial updates [32,56] with their characteristic notion of inconsistency (conflict). Simultaneous removal of m resp.…”

Section: Marking( P) := Newv Al T (Marking( P))mentioning

confidence: 99%

Concurrent abstract state machines

Börger

Schewe

2015

Acta Informatica

View full text Add to dashboard Cite

A concurrent Abstract State Machine (ASM) is a family of agents each equipped with a sequential ASM to execute. We define the semantics of concurrent ASMs by concurrent ASM runs which overcome the problems of Gurevich's distributed ASM runs and generalize Lamport's sequentially consistent runs. A postulate characterizing an intuitive understanding of concurrency is formulated. It allows us to state and prove an extension of the sequential ASM thesis to a concurrent ASM thesis.

show abstract

“…Alternative, equally-expressive characterizations of VAS / VASS have been proposed in the literature, e.g., [11,12]. In the following, we will provide a slightly different, but equivalent, formulation of VASS that better suits our needs.…”

Section: Vector Addition Systemsmentioning

confidence: 99%

Metric propositional neighborhood logic with an equivalence relation

Montanari

Pazzaglia²,

Sala

2016

Acta Informatica

View full text Add to dashboard Cite

The propositional interval logic of temporal neighborhood (PNL for short) features two modalities that make it possible to access intervals adjacent to the right (modality xAy) and to the left (modality xAy) of the current interval. PNL stands at a central position in the realm of interval temporal logics, as it is expressive enough to encode meaningful temporal conditions and decidable (undecidability rules over interval temporal logics, while PNL is NEXPTIME-complete). Moreover, it is expressively complete with respect to the two-variable fragment of first-order logic extended with a linear order FO 2 răs. Various extensions of PNL have been studied in the literature, including metric, hybrid, and first-order ones. Here, we study the effects of the addition of an equivalence relation " to Metric PNL (MPNL"). We first show that the finite satisfiability problem for PNL extended with " is still NEXPTIME-complete. Then, we prove that the same problem for MPNL" can be reduced to the decidable 0-0 reachability problem for vector addition systems and vice versa (EXPSPACE-hardness immediately follows).

show abstract

Parallel program schemata

Cited by 798 publications

References 5 publications

Semantic Quality Attributes for Big-Step Modelling Languages

Semantic Quality Attributes for Big-Step Modelling Languages

Concurrent abstract state machines

Metric propositional neighborhood logic with an equivalence relation

Contact Info

Product

Resources

About