Re: [$ieee-1850] Third draft (Mar-8) of IEEE-1850 PSL LRM

Ben,

Regarding your first comment,
I think the word "suffix" is an essential part in the names of the
operators |-> and |=>. It carries the information that the implication
is done at the end of a match of a sequence rather than at the
beginning. In particular it distinguishes from -> and the operator =>
that was suggested to be added to PSL (with the meaning of "-> next")
and referred to future discussions. The latter two operators are
(overlapping) implication and non-overlapping implication.

Regarding your second comment,
if a comment in such a spirit is added it should be phrased in the
terminology defined in the LRM. The term "match" is not defined in the
LRM. The term used in the LRM is "holds tightly". So for example, "—
(empty : seq) does not result in a match" should read "— (empty : seq)
does not hold tightly on any path"

Best regards,
Dana.



On Mon, 7 Mar 2005 22:04:00 -0800, ben cohen <hdlcohen@gmail.com> wrote:
> Harry,
> I am still going through the document.  However, attached is a one
> page pdf file that has some initial feedback.
> Ben
> 
> --------------------------------------------------------------------------
> Ben Cohen Trainer, Consultant, Publisher (310) 721-4830
> http://www.vhdlcohen.com/  ben_ f rom _abv-sva.org
> * Co-Author: SystemVerilog Assertions Handbook, 2005 ISBN 0-9705394-7-9
> * Co-Author: Using PSL/SUGAR for Formal and Dynamic Verification 2nd
> Edition, 2004, ISBN 0-9705394-6-0
> * Real Chip Design and Verification Using Verilog and VHDL, 2002 isbn
> 0-9705394-2-8
> * Component Design by Example ", 2001 isbn 0-9705394-0-1
> * VHDL Coding Styles and Methodologies, 2nd Edition, 1999 isbn 0-7923-8474-1
> * VHDL Answers to Frequently Asked Questions, 2nd Edition, isbn 0-7923-8115
> ---------------------------------------------------------------------------
> 
> 
>