2006
DOI: 10.1007/11823230_24
|View full text |Cite
|
Sign up to set email alerts
|

Proving the Properties of Communicating Imperfectly-Clocked Synchronous Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2009
2009
2015
2015

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 11 publications
0
5
0
Order By: Relevance
“…(2) We have t = T (t ) where T (r) 1 S ∪ r • t since a state s is reachable from s in n 0 steps if and only if n = 0 and s = s or n > 0 and s is reachable from a successor of s in n − 1 steps. Moreover if T (r) = 1 S ∪ t • r ⊆ r then t ⊆ r. It follows that t = lfp ⊆ T , by definition of the ⊆-least fixpoint lfp ⊆ T of T .…”
Section: Big-step Operational Semanticsmentioning
confidence: 98%
See 1 more Smart Citation
“…(2) We have t = T (t ) where T (r) 1 S ∪ r • t since a state s is reachable from s in n 0 steps if and only if n = 0 and s = s or n > 0 and s is reachable from a successor of s in n − 1 steps. Moreover if T (r) = 1 S ∪ t • r ⊆ r then t ⊆ r. It follows that t = lfp ⊆ T , by definition of the ⊆-least fixpoint lfp ⊆ T of T .…”
Section: Big-step Operational Semanticsmentioning
confidence: 98%
“…Additional domains on time properties were defined in [2]. This temporal aspect does not only enable proving temporal properties, but also allows the automatic definition of a reduced product [9], the time becoming a common language between them.…”
Section: Continuous-time Semantics and Temporal Abstract Domainsmentioning
confidence: 99%
“…The development [4] of two more continuous-time temporal domains in order to prove statically and automatically the properties of imperfectly clocked synchronous systems was successful, but developing each abstract domain is a lot of work.…”
Section: Temporal Abstract Domain a An Examplementioning
confidence: 99%
“…A second domain of change counting 60 This domain is more precise for forward operators and defines a very precise reduced product with the abstract constraint domain.…”
Section: Ivd2 Changes Counting Domainmentioning
confidence: 99%