Results 1 
5 of
5
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1177 (17 self)
 Add to MetaCart
(Show Context)
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
Fischer's Protocol in Timed Process Algebra
, 1994
"... Timed algebraic process theories can be developed with quite different purposes in mind. One can aim for theoretical results about the theory itself (completeness, expressiveness, decidability), or one can aim for practical applicability to nontrivial protocols. Unfortunately, these aims do not go ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Timed algebraic process theories can be developed with quite different purposes in mind. One can aim for theoretical results about the theory itself (completeness, expressiveness, decidability), or one can aim for practical applicability to nontrivial protocols. Unfortunately, these aims do not go well together. In this paper we take two theories, which are probably of the first kind, and try to find out how well suited they are for practical verifications. We verify Fischer's protocol for mutual exclusion in the settings of discretetime process algebra (ACP dt ) and realtime process algebra (ACP ur ). We do this by transforming the recursive specification into an equivalent linear specification, and then dividing out the maximal bisimulation relation. The required mutual exclusion result can then be found by reasoning about the obtained process graph. Finally, we consider the ease of the verification, and ways to adapt the theory to make it more practical. It will turn out that the...
IOS Press Computing Properties of Numerical Imperative Programs by Symbolic Computation
"... Abstract. We show how properties of an interesting class of imperative programs can be calculated by means of relational modeling and symbolic computation. The ideas of [5, 26] are implemented using symbolic computations based on Maple [30]. ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We show how properties of an interesting class of imperative programs can be calculated by means of relational modeling and symbolic computation. The ideas of [5, 26] are implemented using symbolic computations based on Maple [30].
A ProCoS Project Final Report: ESPRIT Basic Research project 7071
, 1996
"... An overview of the research and associated activities of the European collaborative ESPRIT Basic Research ProCoS II Project (no. 7071) on "Provably Correct Systems" which ran from 1992 to 1995 is presented. This was a followon project to ProCoS (no. 3104) and ran in parallel with the ProC ..."
Abstract
 Add to MetaCart
An overview of the research and associated activities of the European collaborative ESPRIT Basic Research ProCoS II Project (no. 7071) on "Provably Correct Systems" which ran from 1992 to 1995 is presented. This was a followon project to ProCoS (no. 3104) and ran in parallel with the ProCoSWG Working Group (no. 8694). A comprehensive bibliography of publications is included for those wishing to study the results of the project in greater depth.
of Computing Real Space Process Algebra
"... Abstract. The real time process algebra of Baeten and Bergstra [Formal Aspects of Computing, 3, 142188 (1991)] is extended to real space by requiring the presence of spatial coordinates for each atomic action, in addition to the required temporal attribute. It is found that asynchronous communicati ..."
Abstract
 Add to MetaCart
Abstract. The real time process algebra of Baeten and Bergstra [Formal Aspects of Computing, 3, 142188 (1991)] is extended to real space by requiring the presence of spatial coordinates for each atomic action, in addition to the required temporal attribute. It is found that asynchronous communication cannot easily be avoided. Based on the state operators of Baeten and Bergstra [Information and Computation, 78, 205245 (1988)] and following Bergstra et al. [Proc. Seminar on Concurrency, LNCS 197, Springer, 1985, pp. 7695], asychronous communication mechanisms are introduced as an additional feature of real space process algebra. The overall emphasis is on the introductory explanation of the features of real space process algebra, and characteristic examples are given for each of these. 1.