Precongruence Formats for Decorated Trace Semantics

Details Precongruence Formats for Decorated Trace Semantics Precongruence Formats for Decorated Trace Semantics

2002-04-17

arxiv.org/abs/cs/0204039v1

Computer Science

Logic in Computer Science

48 pages. More info at http://theory.stanford.edu/~rvg/abstracts.html#48

Scientific paper

This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats of transition system specifications using Plotkin's structural approach. For several preorders in the linear time - branching time spectrum a format is given, as general as possible, such that this preorder is a precongruence for all operators specifiable in that format. The formats are derived using the modal characterizations of the corresponding preorders.

Affiliated with

Also associated with

No associations

Rating

Precongruence Formats for Decorated Trace Semantics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Precongruence Formats for Decorated Trace Semantics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Precongruence Formats for Decorated Trace Semantics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-304434