The following pages link to Turning SOS rules into equations (Q1327393):
Displaying 46 items.
- Rule formats for determinism and idempotence (Q433348) (← links)
- SOS rule formats for zero and unit elements (Q549170) (← links)
- On cool congruence formats for weak bisimulations (Q549196) (← links)
- Structural operational semantics for weak bisimulations (Q673123) (← links)
- A syntactic commutativity format for SOS (Q835035) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- Compositional semantics and behavioral equivalences for P systems (Q924685) (← links)
- Generating priority rewrite systems for OSOS process languages (Q1012121) (← links)
- GSOS and finite labelled transition systems (Q1331924) (← links)
- A \(\pi\)-calculus with explicit substitutions (Q1350998) (← links)
- A process algebra of communicating shared resources with dense time and priorities (Q1389685) (← links)
- A general conservative extension theorem in process algebras with inequalities (Q1391791) (← links)
- An axiomatic semantics for the synchronous language Gentzen. (Q1400575) (← links)
- Finite axiom systems for testing preorder and De Simone process languages (Q1575273) (← links)
- SOS specifications for uniformly continuous operators (Q1678172) (← links)
- Rule formats for distributivity (Q1758150) (← links)
- CCS with Hennessy's merge has no finite-equational axiomatization (Q1763725) (← links)
- Tile formats for located and mobile systems. (Q1854326) (← links)
- Ordered SOS process languages for branching and eager bisimulations (Q1854563) (← links)
- Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS (Q1878715) (← links)
- Axiomatizing GSOS with termination (Q1878716) (← 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)
- Towards general axiomatizations for bisimilarity and trace semantics (Q2237336) (← links)
- Dynamic structural operational semantics (Q2329443) (← links)
- SOS rule formats for idempotent terms and idempotent unary operators (Q2436519) (← links)
- Axiomatizing weak simulation semantics over BCCSP (Q2453533) (← links)
- Notions of bisimulation and congruence formats for SOS with data (Q2486401) (← links)
- A calculus for team automata (Q2873606) (← links)
- Modal logic and the approximation induction principle (Q2883116) (← links)
- Proving the validity of equations in GSOS languages using rule-matching bisimilarity (Q2883120) (← links)
- The Equational Theory of Weak Complete Simulation Semantics over BCCSP (Q2891363) (← links)
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi (Q2974795) (← links)
- Axiomatizing Weak Ready Simulation Semantics over BCCSP (Q3105742) (← links)
- Compositional Abstraction in Real-Time Model Checking (Q3543301) (← links)
- Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination (Q4917024) (← links)
- Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? (Q5056368) (← links)
- An algebraic framework for developing and maintaining real-time systems (Q5096395) (← links)
- A Calculus of Countable Broadcasting Systems (Q5096402) (← links)
- CPO models for a class of GSOS languages (Q5096748) (← links)
- A π-calculus with explicit substitutions: The late semantics (Q5096892) (← links)
- Compositional weak metrics for group key update (Q5111289) (← links)
- From rewrite rules to bisimulation congruences (Q5958468) (← links)
- Explicit substitutions for \(\pi\)-congruences (Q5958613) (← links)
- An axiomatic semantics for Esterel (Q5958617) (← links)
- Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction (Q6163879) (← links)
