HSAFT
1993
14 years 24 days ago
1993
CPE
1994
Springer
14 years 25 days ago
1994
Springer
CPE
1994
Springer
14 years 25 days ago
1994
Springer
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
CAV
1994
Springer
14 years 25 days ago
1994
Springer
This paper presents a new formalism and a new algorithm for verifying timed circuits. The formalism, called orbital nets, allows hierarchical verification based on abehavioralseman...
CAV
1994
Springer
14 years 25 days ago
1994
Springer
Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are P-complete and hence it may not be possible to design ...
CAV
1994
Springer
14 years 25 days ago
1994
Springer
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a...
CHARME
1993
Springer
14 years 25 days ago
1993
Springer
CHARME
1993
Springer
14 years 25 days ago
1993
Springer
To perform veri cation of digital systems with time bounded delays, it is essential to characterize the space of all possible system behaviors. In this paper, we describe our analy...
CAV
1993
Springer
14 years 25 days ago
1993
Springer
Abstract. This paper presents a scalable approach to reasoning formally about distributed algorithms. It uses results about I O automata to extract a set of proof obligations for s...
CAV
1993
Springer
14 years 25 days ago
1993
Springer
Abstract. We describe the implementation, within ALDEBARAN of an algorithmic method allowing the generation of a minimal labeled transition rom an abstract model ; this minimality ...