The tyft/tyxt format reduces to tree rules

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

Groote and Vaandrager [5] introduced the tyft/tyxt format for transition system specifications (TSSs), and established that for each TSS in this format that is well-founded, the strong bisimulation it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an equivalent TSS that consists of tree rules only. As a corollary we can give an affirmative answer to an open question, namely whether the well-foundedness condition in the Congruence Theorem of [5] can be dropped. These results extend to tyft/tyxt with negative premises and predicates.

Original languageEnglish
Title of host publicationTheoretical Aspects of Computer Software - International Symposium TACS 1994, Proceedings
EditorsJohn C. Mitchell, Masami Hagiya
PublisherSpringer - Verlag
Pages440-453
Number of pages14
ISBN (Print)9783540578871
Publication statusPublished - 1 Jan 1994
Event2nd International Symposium on Theoretical Aspects of Computer Software, TACS 1994 - Sendai, Japan
Duration: 19 Apr 199422 Apr 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume789 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Symposium on Theoretical Aspects of Computer Software, TACS 1994
CountryJapan
CitySendai
Period19/04/9422/04/94

Fingerprint

Transition Systems
Specification
Specifications
Congruence
Bisimulation
Predicate
Corollary
Theorem

Cite this

Fokkink, W. J. (1994). The tyft/tyxt format reduces to tree rules. In J. C. Mitchell, & M. Hagiya (Eds.), Theoretical Aspects of Computer Software - International Symposium TACS 1994, Proceedings (pp. 440-453). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 789 LNCS). Springer - Verlag.
Fokkink, Willem Jan. / The tyft/tyxt format reduces to tree rules. Theoretical Aspects of Computer Software - International Symposium TACS 1994, Proceedings. editor / John C. Mitchell ; Masami Hagiya. Springer - Verlag, 1994. pp. 440-453 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{60d5a4ca61ce4d66a1869d1991c870e9,
title = "The tyft/tyxt format reduces to tree rules",
abstract = "Groote and Vaandrager [5] introduced the tyft/tyxt format for transition system specifications (TSSs), and established that for each TSS in this format that is well-founded, the strong bisimulation it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an equivalent TSS that consists of tree rules only. As a corollary we can give an affirmative answer to an open question, namely whether the well-foundedness condition in the Congruence Theorem of [5] can be dropped. These results extend to tyft/tyxt with negative premises and predicates.",
author = "Fokkink, {Willem Jan}",
year = "1994",
month = "1",
day = "1",
language = "English",
isbn = "9783540578871",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer - Verlag",
pages = "440--453",
editor = "Mitchell, {John C.} and Masami Hagiya",
booktitle = "Theoretical Aspects of Computer Software - International Symposium TACS 1994, Proceedings",

}

Fokkink, WJ 1994, The tyft/tyxt format reduces to tree rules. in JC Mitchell & M Hagiya (eds), Theoretical Aspects of Computer Software - International Symposium TACS 1994, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 789 LNCS, Springer - Verlag, pp. 440-453, 2nd International Symposium on Theoretical Aspects of Computer Software, TACS 1994, Sendai, Japan, 19/04/94.

The tyft/tyxt format reduces to tree rules. / Fokkink, Willem Jan.

Theoretical Aspects of Computer Software - International Symposium TACS 1994, Proceedings. ed. / John C. Mitchell; Masami Hagiya. Springer - Verlag, 1994. p. 440-453 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 789 LNCS).

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - The tyft/tyxt format reduces to tree rules

AU - Fokkink, Willem Jan

PY - 1994/1/1

Y1 - 1994/1/1

N2 - Groote and Vaandrager [5] introduced the tyft/tyxt format for transition system specifications (TSSs), and established that for each TSS in this format that is well-founded, the strong bisimulation it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an equivalent TSS that consists of tree rules only. As a corollary we can give an affirmative answer to an open question, namely whether the well-foundedness condition in the Congruence Theorem of [5] can be dropped. These results extend to tyft/tyxt with negative premises and predicates.

AB - Groote and Vaandrager [5] introduced the tyft/tyxt format for transition system specifications (TSSs), and established that for each TSS in this format that is well-founded, the strong bisimulation it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an equivalent TSS that consists of tree rules only. As a corollary we can give an affirmative answer to an open question, namely whether the well-foundedness condition in the Congruence Theorem of [5] can be dropped. These results extend to tyft/tyxt with negative premises and predicates.

UR - http://www.scopus.com/inward/record.url?scp=21344487302&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=21344487302&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9783540578871

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 440

EP - 453

BT - Theoretical Aspects of Computer Software - International Symposium TACS 1994, Proceedings

A2 - Mitchell, John C.

A2 - Hagiya, Masami

PB - Springer - Verlag

ER -

Fokkink WJ. The tyft/tyxt format reduces to tree rules. In Mitchell JC, Hagiya M, editors, Theoretical Aspects of Computer Software - International Symposium TACS 1994, Proceedings. Springer - Verlag. 1994. p. 440-453. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).