CAV
13 years 10 months 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...
CAV
13 years 10 months 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
13 years 10 months ago
1994 Springer CAV
13 years 10 months 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 ...
|