Subject: Re: [sv-ac] Cyclicity issues
From: John Havlicek (john.havlicek@motorola.com)
Date: Thu Feb 13 2003 - 05:55:19 PST
Hi Joseph:
> seq s = (x;y)
> seq t = (y;x)
>
> Property:
>
> assert: if (mode == T) then not(s and t)
I see no problem with these definitions. I would not
call them cyclic. The "syntactic dependency graph" for
them looks like
s -----> x <----- t
| |
----> y <----
which is not cyclic (as a directed graph).
Best regards,
John Havlicek
This archive was generated by hypermail 2b28 : Thu Feb 13 2003 - 05:55:57 PST