Process Spaces

Negulescu, R.

doi:10.1007/3-540-44618-4_16

Cited by 24 publications

(22 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As in [14], conjunction, disjunction and quotient are not considered. Process spaces introduced by Negulescu [29,30] are an abstract theory of process executions which allows one to separate assumptions on the environment from the requirements of processes. Dill's trace structures can be instantiated in this theory, but our results are not derivable.…”

Section: Related Workmentioning

confidence: 99%

An algebraic theory of interface automata

Chilton

Jönsson

Kwiatkowska

2014

Theoretical Computer Science

View full text Add to dashboard Cite

We formulate a compositional specification theory for interface automata, where a component model specifies the allowed sequences of input and output interactions with the environment. A trace-based linear-time refinement is provided, which is the weakest preorder preserving substitutivity of components, and is weaker than the classical alternating simulation defined on interface automata. Since our refinement allows a component to be refined by refusing to produce any output, we also define a refinement relation that guarantees safety and progress. The theory includes the operations of parallel composition to support the structural composition of components, logical conjunction and disjunction for independent development, hiding to support abstraction of interfaces, and quotient for incremental synthesis of components. Our component formulation highlights the algebraic properties of the specification theory for both refinement preorders, and is shown to be fully abstract with respect to observation of communication mismatches. Examples of independent and incremental component development are provided.

show abstract

Section: Related Workmentioning

confidence: 99%

An algebraic theory of interface automata

Chilton

Jönsson

Kwiatkowska

2014

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…[37][38][39][40], the use of contracts is extended to serve as a central design philosophy in systems engineering to support the design of CPS. As mentioned in Sec.…”

Section: Environment-centric Contractsmentioning

confidence: 99%

Environment-Centric Contracts for Design of Cyber-Physical Systems

Westman

Nyberg

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. A contract splits the responsibilities between a component and its environment into a guarantee that expresses an intended property under the responsibility of the component, given that the environment fulfills the assumptions. Although current contract theories are limited to express contracts over interfaces of components, specifications that are not limited to interfaces are used in practice and are needed in order to properly express safety requirements. A framework is therefore presented, generalizing current contract theory to environment-centric contracts -contracts that are not limited to the interface of components. The framework includes revised definitions of properties of contracts, as well as theorems that specifies exact conditions for when the properties hold. Furthermore, constraints are introduced, limiting the ports over which an environment-centric contract is expressed where the constraints constitute necessary conditions for the guarantee of the contract to hold in an architecture.

show abstract

“…In subsection 2.1, we briefly overview the necessary notions from our verification framework, called process spaces; for more details, we refer the reader to [11] and [12]. In subsection 2.2., we briefly overview the active-edge specifications introduced in [7] and [13], which are used here to simplify the specification of control signals.…”

Section: Preliminariesmentioning

confidence: 99%

“…Two types of control ports proposed by [12], Demand-type (D-port) and Poll-type (P-port), are employed to control data transfer between two clock domains in a self-timed manner. Fig.…”

Section: Asynchronous Communicationmentioning

confidence: 99%

“…The worst-case scenario is where every data item is duplicated at the receiver side. In [12], there are no mentions of this danger for duplication. Even though the duplication of items might be fixed inside the receiver block by another level of the communication protocol, the duplication would still undesirable because the computation tasks for receiver would be doubled.…”

Section: Control Ports Verificationmentioning

confidence: 99%

See 1 more Smart Citation

Refinement-Based Formal Verification of Asynchronous Wrappers for Independently Clocked Domains in Systems on Chip

Kong

Negulescu

Ying

2001

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper we propose a novel refinement-based technique to formally verify data transfer in an asynchronous timing framework. Novel data transfer models are proposed to represent data communication between two locally independent clock domains. As a case study, we apply our technique to verify data transfer in a previously published architecture for globally asynchronous locally synchronous on-chip systems. In this case study, we find several race conditions, hazards, and other dangers that were not mentioned in the original publication, and we find additional delay constraints that avoid some of the detected dangers.

show abstract

Process Spaces

Cited by 24 publications

References 11 publications

An algebraic theory of interface automata

An algebraic theory of interface automata

Environment-Centric Contracts for Design of Cyber-Physical Systems

Refinement-Based Formal Verification of Asynchronous Wrappers for Independently Clocked Domains in Systems on Chip

Contact Info

Product

Resources

About