Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Failures semantics based on interval semiwords is a congruence for refinement

Failures semantics based on interval semiwords is a congruence for refinement In this paper concurrent systems are modelled with safe Petri nets. The coarsest equivalence contained in failures equivalence is determined that is a congruence with respect to refinement. It is shown that in this context partial orders are necessary for the description of system runs: what is needed here are so-called interval orders. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Distributed Computing Springer Journals

Failures semantics based on interval semiwords is a congruence for refinement

Distributed Computing , Volume 4 (3) – May 11, 2005

Loading next page...
 
/lp/springer-journals/failures-semantics-based-on-interval-semiwords-is-a-congruence-for-L6Wihr93X8

References (55)

Publisher
Springer Journals
Copyright
Copyright © 1991 by Springer-Verlag
Subject
Computer Science; Computer Communication Networks; Computer Hardware; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Theory of Computation
ISSN
0178-2770
eISSN
1432-0452
DOI
10.1007/BF01798961
Publisher site
See Article on Publisher Site

Abstract

In this paper concurrent systems are modelled with safe Petri nets. The coarsest equivalence contained in failures equivalence is determined that is a congruence with respect to refinement. It is shown that in this context partial orders are necessary for the description of system runs: what is needed here are so-called interval orders.

Journal

Distributed ComputingSpringer Journals

Published: May 11, 2005

There are no references for this article.