Introduced in this paper is a new graphical modeling language for specifying concurrency in software designs. The language notations are derived from CSP and the resulting designs form CSP diagrams. The notations reflect both data-flow and control-flow aspects, as well as along with CSP algebraic expressions that can be used for formal analysis. The designer does not have to be aware of the underlying mathematics. The techniques and rules presented provide guidance to the development of concurrent software architectures. One can detect and reason about compositional conflicts (errors in design), potential deadlocks (errors at run-time), and priority inversion problems (performance burden) at a high level of abstraction. The CSP diagram coll...
We describe practical experiences of using a logic programming based approach to model and reason ab...
This paper presents in a nutshell a procedure for producing formally verified concurrent software. T...
The paper describes a way of using standard formal analysis tools for checking deadlock freedom in g...
Introduced in this paper is a new graphical modeling language for specifying concurrency in software...
Abstract. Introduced in this paper is a new graphical modeling language for specifying concurrency i...
Introduced in this (shortened) paper is a graphical modelling language for specifying concurrency in...
Concurrency is generally considered to be difficult due to a lack of appropriate abstraction, rather...
Realization of embedded control systems is a complex task. Increasing part of this complexity is now...
The group of the faculty EE-Math-CS of the University of Twente is developing a graphical modeling l...
In this thesis, we are concerned with the development of concurrent software for embedded systems. T...
The report describes the development of a concurrency model suited for real-time systems and a grap...
The CSP language allows the specification and verification of complex concurrent systems. Many anal...
SystemCSP is a graphical design specification language aimed to serve as a basis for the specificati...
SystemCSP is a graphical design specification language aimed to serve as a basis for the specificati...
The use of formal notations has many advantages in the specification of interactive systems. However...
We describe practical experiences of using a logic programming based approach to model and reason ab...
This paper presents in a nutshell a procedure for producing formally verified concurrent software. T...
The paper describes a way of using standard formal analysis tools for checking deadlock freedom in g...
Introduced in this paper is a new graphical modeling language for specifying concurrency in software...
Abstract. Introduced in this paper is a new graphical modeling language for specifying concurrency i...
Introduced in this (shortened) paper is a graphical modelling language for specifying concurrency in...
Concurrency is generally considered to be difficult due to a lack of appropriate abstraction, rather...
Realization of embedded control systems is a complex task. Increasing part of this complexity is now...
The group of the faculty EE-Math-CS of the University of Twente is developing a graphical modeling l...
In this thesis, we are concerned with the development of concurrent software for embedded systems. T...
The report describes the development of a concurrency model suited for real-time systems and a grap...
The CSP language allows the specification and verification of complex concurrent systems. Many anal...
SystemCSP is a graphical design specification language aimed to serve as a basis for the specificati...
SystemCSP is a graphical design specification language aimed to serve as a basis for the specificati...
The use of formal notations has many advantages in the specification of interactive systems. However...
We describe practical experiences of using a logic programming based approach to model and reason ab...
This paper presents in a nutshell a procedure for producing formally verified concurrent software. T...
The paper describes a way of using standard formal analysis tools for checking deadlock freedom in g...