Pages that link to "Item:Q1198952"

The following pages link to Structured operational semantics and bisimulation as a congruence (Q1198952):

Displaying 50 items.

• Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
• Kleene's three-valued logic and process algebra (Q293327) (← links)
• Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity (Q418189) (← links)
• Rule formats for determinism and idempotence (Q433348) (← links)
• Nested semantics over finite trees are equationally hard (Q598202) (← links)
• Structural operational semantics for weak bisimulations (Q673123) (← links)
• Transition system specifications with negative premises (Q685387) (← links)
• Behavioral abstraction is hiding information (Q703529) (← links)
• A syntactic commutativity format for SOS (Q835035) (← links)
• SOS formats and meta-theory: 20 years after (Q877025) (← links)
• CSP is a retract of CCS (Q960852) (← links)
• A precongruence format for should testing preorder (Q974134) (← links)
• Semantics and expressiveness of ordered SOS (Q1012119) (← links)
• Generating priority rewrite systems for OSOS process languages (Q1012121) (← links)
• A conservative look at operational semantics with variable binding (Q1273877) (← links)
• A complete equational axiomatization for MPA with string iteration (Q1274456) (← links)
• GSOS and finite labelled transition systems (Q1331924) (← links)
• When is partial trace equivalence adequate? (Q1333407) (← links)
• A complete equational axiomatization for prefix iteration (Q1342264) (← links)
• A \(\pi\)-calculus with explicit substitutions (Q1350998) (← links)
• A general conservative extension theorem in process algebras with inequalities (Q1391791) (← links)
• An alternative formulation of operational conservativity with binding terms. (Q1400151) (← links)
• Finite axiom systems for testing preorder and De Simone process languages (Q1575273) (← links)
• Swinging types=functions+relations+transition systems (Q1575635) (← links)
• Language preorder as a precongruence (Q1575654) (← links)
• Universal coalgebra: A theory of systems (Q1583483) (← links)
• Dynamic connectors for concurrency (Q1603689) (← links)
• Compositional SOS and beyond: A coalgebraic view of open systems (Q1603820) (← links)
• Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity (Q1680509) (← links)
• Observational congruences for dynamically reconfigurable tile systems (Q1782000) (← links)
• Action transducers and timed automata (Q1816917) (← links)
• Discrimination by parallel observers: the algorithm. (Q1854269) (← links)
• Tile formats for located and mobile systems. (Q1854326) (← links)
• Bisimilarity of open terms. (Q1854331) (← links)
• Ordered SOS process languages for branching and eager bisimulations (Q1854563) (← links)
• The meaning of negative premises in transition system specifications. II (Q1878713) (← links)
• Rule formats for compositional non-interference properties (Q1878717) (← 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)
• Rooted branching bisimulation as a congruence (Q1975965) (← links)
• Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
• Congruence from the operator's point of view. Syntactic requirements on modal characterizations (Q2182663) (← links)
• Computing branching distances with quantitative games (Q2210522) (← links)
• Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence (Q2272990) (← links)
• A linear-time-branching-time spectrum for behavioral specification theories (Q2291820) (← links)
• Denotational fixed-point semantics for constructive scheduling of synchronous concurrency (Q2350494) (← links)
• Computable processes and bisimulation equivalence (Q2365394) (← links)
• Compositionality of Hennessy-Milner logic by structural operational semantics (Q2368979) (← links)
• Operational semantics for Petri net components (Q2373704) (← links)
• A unified rule format for bounded nondeterminism in SOS with terms as labels (Q2403821) (← links)