The meaning of negative premises in transition system specifications

DOI10.1145/234752.234756zbMath0889.68113OpenAlexW1969947545MaRDI QIDQ4371690

Roland N. Bol, Jan Friso Groote

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

zbMATH Keywords

transition system specifications

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Pushdown Automata and Context-Free Grammars in Bisimulation Semantics, 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, When is partial trace equivalence adequate?, Compositionality of Hennessy-Milner logic by structural operational semantics, A format for semantic equivalence comparison, Branching time and orthogonal bisimulation equivalence, A syntactic commutativity format for SOS, A general SOS theory for the specification of probabilistic transition systems, A Pre-congruence Format for XY-simulation, SOS formats and meta-theory: 20 years after, Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity, A general conservative extension theorem in process algebras with inequalities, Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\), An alternative formulation of operational conservativity with binding terms., On the axiomatisability of priority. III: Priority strikes again, Lang-n-Send Extended: Sending Regular Expressions to Monitors, Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity, Back to the format: a survey on SOS for probabilistic processes, Branching vs. Linear Time: Semantical Perspective, Unnamed Item, A Rule Format for Associativity, Rooted branching bisimulation as a congruence, Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity, Some undecidable properties of SOS specifications, Variable binding operators in transition system specifications, On recursive operations over logic LTS, Ensuring liveness properties of distributed systems: open problems, Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes, Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence, The expressiveness of CSP with priority, Structural Operational Semantics with First-Order Logic, Automating Soundness Proofs, Semantics and expressiveness of ordered SOS, Encoding safety in \(\mathrm{CLL}_R\), 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, Language preorder as a precongruence, Divide and congruence III: Stability & divergence, The compression structure of a process, Non Expansive ε-Bisimulations, A Congruence Rule Format with Universal Quantification, A Calculus for Team Automata, On the greatest solution of equations in \(\mathrm{CLL}_R\)