The meaning of negative premises in transition system specifications
From MaRDI portal
Publication:4371690
DOI10.1145/234752.234756zbMath0889.68113MaRDI QIDQ4371690
Jan Friso Groote, Roland N. Bol
Publication date: 22 January 1998
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/1339
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Non Expansive ε-Bisimulations, Variable binding operators in transition system specifications, SOS formats and meta-theory: 20 years after, Semantics and expressiveness of ordered SOS, A conservative look at operational semantics with variable binding, Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements, Operational semantics of rewriting with priorities, The reduced relative power operation on abstract domains, When is partial trace equivalence adequate?, A general conservative extension theorem in process algebras with inequalities, An alternative formulation of operational conservativity with binding terms., Language preorder as a precongruence, The meaning of negative premises in transition system specifications. II, Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation, A format for semantic equivalence comparison, Branching time and orthogonal bisimulation equivalence, Rooted branching bisimulation as a congruence, Compositionality of Hennessy-Milner logic by structural operational semantics, Branching vs. Linear Time: Semantical Perspective, A Rule Format for Associativity
