Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2010
2010
2015
2015

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 10 publications
0
6
0
Order By: Relevance
“…The set of ρLT L formulas over a finite set of port names N and a finite data set D is inductively defined by the following grammar [6] such that N ⊆ N and r ∈ RecN (D):…”
Section: Record-based Linear Time Temporal Logicmentioning
confidence: 99%
See 1 more Smart Citation
“…The set of ρLT L formulas over a finite set of port names N and a finite data set D is inductively defined by the following grammar [6] such that N ⊆ N and r ∈ RecN (D):…”
Section: Record-based Linear Time Temporal Logicmentioning
confidence: 99%
“…Let ϕ be a ρLT L formula and < B, l > be an ABAR over the set of port names N and the set of data items D. The property induced by ϕ is identified by: W ords(ϕ) = {M ∈ GS|M |= ϕ} where GS is the set of guarded strings over N and D. The ABAR < B, l > satisfies ϕ (< B, l >|= ϕ) if and only if GL(< B, l >) ⊆ W ords(ϕ) [4], [6].…”
Section: Record-based Linear Time Temporal Logicmentioning
confidence: 99%
“…The Red producer code (lines [23][24][25][26][27][28][29][30][31]) is analogous to that of the Green producer, with "red" and "green" swapped. This is a simple concurrent application whose code has been made even simpler by abstracting away its computation and declarations.…”
Section: Fig 1 Alternating Producers and Consumermentioning
confidence: 99%
“…Variants of the constraint automata model have been devised to capture timesensitive behavior [11,53,54], probabilistic behavior [20], stochastic behavior [26], context sensitive behavior [29,34,41], fairness [30,42], resource sensitivity [66], and the QoS aspects [12,13,67,70,71] of Reo connectors and composite systems.…”
Section: Semanticsmentioning
confidence: 99%
“…Moreover, the authors admit to have considerable problems with performance. Bonsangue and Izadi [14] defined semantics of context-dependent Reo connectors in terms of Büchi automata and generalized standard automata based model checking algorithms to enable verification of LTL formulas for Reo connectors. However, this work is purely theoretical and is not supported by any existing software tool.…”
Section: Related Workmentioning
confidence: 99%