Pages that link to "Item:Q4371690"

The following pages link to The meaning of negative premises in transition system specifications (Q4371690):

Displaying 46 items.

• Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity (Q418189) (← links)
• Some undecidable properties of SOS specifications (Q511941) (← links)
• A syntactic commutativity format for SOS (Q835035) (← links)
• SOS formats and meta-theory: 20 years after (Q877025) (← links)
• Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\) (Q893593) (← links)
• Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes (Q974113) (← links)
• Semantics and expressiveness of ordered SOS (Q1012119) (← links)
• The compression structure of a process (Q1044743) (← links)
• A conservative look at operational semantics with variable binding (Q1273877) (← links)
• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements (Q1275821) (← links)
• Operational semantics of rewriting with priorities (Q1276259) (← links)
• The reduced relative power operation on abstract domains (Q1285656) (← links)
• When is partial trace equivalence adequate? (Q1333407) (← links)
• A general conservative extension theorem in process algebras with inequalities (Q1391791) (← links)
• An alternative formulation of operational conservativity with binding terms. (Q1400151) (← links)
• Language preorder as a precongruence (Q1575654) (← links)
• Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity (Q1680509) (← links)
• The meaning of negative premises in transition system specifications. II (Q1878713) (← links)
• Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation (Q1878718) (← links)
• A format for semantic equivalence comparison (Q1884897) (← links)
• Branching time and orthogonal bisimulation equivalence (Q1884905) (← links)
• Rooted branching bisimulation as a congruence (Q1975965) (← links)
• Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
• Encoding safety in \(\mathrm{CLL}_R\) (Q2055960) (← links)
• On the axiomatisability of priority. III: Priority strikes again (Q2193294) (← links)
• Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence (Q2272990) (← links)
• On the greatest solution of equations in \(\mathrm{CLL}_R\) (Q2353634) (← links)
• Compositionality of Hennessy-Milner logic by structural operational semantics (Q2368979) (← links)
• The expressiveness of CSP with priority (Q2520703) (← links)
• A general SOS theory for the specification of probabilistic transition systems (Q2629851) (← links)
• Structural Operational Semantics with First-Order Logic (Q2810690) (← links)
• Automating Soundness Proofs (Q2810691) (← links)
• A Congruence Rule Format with Universal Quantification (Q2871833) (← links)
• A Calculus for Team Automata (Q2873606) (← links)
• A Pre-congruence Format for XY-simulation (Q3455865) (← links)
• Branching vs. Linear Time: Semantical Perspective (Q3510781) (← links)
• A Rule Format for Associativity (Q3541037) (← links)
• (Q5013870) (← links)
• Divide and congruence III: Stability & divergence (Q5111628) (← links)
• Non Expansive ε-Bisimulations (Q5505435) (← links)
• On recursive operations over logic LTS (Q5740660) (← links)
• Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity (Q5875352) (← links)
• Pushdown Automata and Context-Free Grammars in Bisimulation Semantics (Q5883743) (← links)
• Variable binding operators in transition system specifications (Q5931555) (← links)
• Lang-n-Send Extended: Sending Regular Expressions to Monitors (Q6122642) (← links)
• Back to the format: a survey on SOS for probabilistic processes (Q6151619) (← links)