\(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
From MaRDI portal
Publication:1917088
DOI10.1006/inco.1996.0030zbMath0853.68124MaRDI QIDQ1917088
Robert J. van Glabbeek, W. J. Fokkink
Publication date: 3 July 1996
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1996.0030
68Q55: Semantics in the theory of computing
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Process algebra with four-valued logic, Variable binding operators in transition system specifications, Bochvar-McCarthy logic and process algebra, Category theory for operational semantics, SOS formats and meta-theory: 20 years after, A conservative look at operational semantics with variable binding, An equational axiomatization for multi-exit iteration, An alternative formulation of operational conservativity with binding terms., Language preorder as a precongruence, Bisimilarity of open terms., The meaning of negative premises in transition system specifications. II, A format for semantic equivalence comparison, Rooted branching bisimulation as a congruence, Compositionality of Hennessy-Milner logic by structural operational semantics, Notions of bisimulation and congruence formats for SOS with data
