The tyft/tyxt format reduces to tree rules

Willem Jan Fokkink

The tyft/tyxt format reduces to tree rules

^*Corresponding author for this work

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic › peer-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 language	English
Title of host publication	Theoretical Aspects of Computer Software - International Symposium TACS 1994, Proceedings
Editors	John C. Mitchell, Masami Hagiya
Publisher	Springer - Verlag
Pages	440-453
Number of pages	14
ISBN (Print)	9783540578871
Publication status	Published - 1 Jan 1994
Event	2nd International Symposium on Theoretical Aspects of Computer Software, TACS 1994 - Sendai, Japan Duration: 19 Apr 1994 → 22 Apr 1994

Publication series

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

Conference

Conference	2nd International Symposium on Theoretical Aspects of Computer Software, TACS 1994
Country/Territory	Japan
City	Sendai
Period	19/04/94 → 22/04/94

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Persistent URL (handle)

Copy link address

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 = jan,

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",

note = "2nd International Symposium on Theoretical Aspects of Computer Software, TACS 1994 ; Conference date: 19-04-1994 Through 22-04-1994",

}

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 proceeding › Conference contribution › Academic › peer-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

AN - SCOPUS:21344487302

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

T2 - 2nd International Symposium on Theoretical Aspects of Computer Software, TACS 1994

Y2 - 19 April 1994 through 22 April 1994

ER -

The tyft/tyxt format reduces to tree rules

Abstract

Publication series

Conference

UN SDGs

Persistent URL (handle)

Other files and links

Fingerprint

Cite this