The Tyft/tyxt Format Reduces to Tree Rules (1993)

Cached

Download Links

by W. J. Fokkink , Willem Jan Fokkink
Venue:Proceedings 2nd Symposium on Theoretical Aspects of Computer Software (TACS'94), Sendai, Japan, LNCS 789
Citations:16 - 4 self

Active Bibliography

54 Ntyft/ntyxt rules reduce to ntree rules – Wan Fokkink, Rob Van Glabbeek - 1996
18 Precongruence Formats for Decorated Trace Semantics – Bard Bloom, Wan Fokkink, Rob J. van Glabbeek
31 A Conservative Look at Operational Semantics with Variable Binding – Wan Fokkink, Chris Verhoef - 1998
10 A conservative look at term deduction systems with variable binding – Wan Fokkink, Chris Verhoef - 1995
15 Rooted branching bisimulation as a congruence – Wan Fokkink - 2000
10 SOS formats and meta-theory: 20 years after – Mohammadreza Mousavi, Michel A. Reniers, Jan Friso Groote - 2007
4 Language preorder as a precongruence – Wan Fokkink
2 Ordered SOS Process Languages for Branching and Eager Bisimulations – Irek Ulidowski, Iain Phillips - 2002
9 Axiomatisations of Weak Equivalences for De Simone Languages – Irek Ulidowski - 1995