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

Learn More →

The meaning of negative premises in transition system specifications

The meaning of negative premises in transition system specifications We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in order to be meaningful, that is, to unequivocally define a transition relation. We also provide powerful techniques for proving that a TSS satisfies this criterion, meanwhile constructing this transition relation. Both the criterion and the techniques originate from logic programming van Gelder et al. 1988; Gelfond and Lifschitz 1988 to which TSSs are close. In an appendix we provide an extensive comparison between them. As in Groote 1993, we show that the bisimulation relation induced by a TSS is a congruence, provided that it is in ntyft/ntyxt -format and can be proved meaningful using our techniques. We also considerably extend the conservativity theorems of Groote1993 and Groote and Vaandrager 1992. As a running example, we study the combined addition of priorities and abstraction to Basic Process Algebra (BPA). Under some reasonable conditions we show that this TSS is indeed meaningful, which could not be shown by other methods Bloom et al. 1995; Groote 1993. Finally, we provide a sound and complete axiomatization for this example. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of the ACM (JACM) Association for Computing Machinery

The meaning of negative premises in transition system specifications

Journal of the ACM (JACM) , Volume 43 (5) – Sep 1, 1996

Loading next page...
 
/lp/association-for-computing-machinery/the-meaning-of-negative-premises-in-transition-system-specifications-o76LK0qpCs

References (49)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1996 by ACM Inc.
ISSN
0004-5411
DOI
10.1145/234752.234756
Publisher site
See Article on Publisher Site

Abstract

We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in order to be meaningful, that is, to unequivocally define a transition relation. We also provide powerful techniques for proving that a TSS satisfies this criterion, meanwhile constructing this transition relation. Both the criterion and the techniques originate from logic programming van Gelder et al. 1988; Gelfond and Lifschitz 1988 to which TSSs are close. In an appendix we provide an extensive comparison between them. As in Groote 1993, we show that the bisimulation relation induced by a TSS is a congruence, provided that it is in ntyft/ntyxt -format and can be proved meaningful using our techniques. We also considerably extend the conservativity theorems of Groote1993 and Groote and Vaandrager 1992. As a running example, we study the combined addition of priorities and abstraction to Basic Process Algebra (BPA). Under some reasonable conditions we show that this TSS is indeed meaningful, which could not be shown by other methods Bloom et al. 1995; Groote 1993. Finally, we provide a sound and complete axiomatization for this example.

Journal

Journal of the ACM (JACM)Association for Computing Machinery

Published: Sep 1, 1996

There are no references for this article.