The following pages link to Bisimulation can't be traced (Q4369863):
Displayed 50 items.
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- Rational operational models (Q265819) (← links)
- Structural congruence for bialgebraic semantics (Q338626) (← links)
- Two-thirds simulation indexes and modal logic characterization (Q352098) (← links)
- Structural operational semantics for stochastic and weighted transition systems (Q383372) (← links)
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity (Q418189) (← links)
- Structural operational semantics for non-deterministic processes with quantitative aspects (Q507377) (← links)
- Some undecidable properties of SOS specifications (Q511941) (← links)
- A general account of coinduction up-to (Q523132) (← links)
- On the axiomatizability of priority. II (Q549169) (← links)
- SOS rule formats for zero and unit elements (Q549170) (← links)
- On cool congruence formats for weak bisimulations (Q549196) (← links)
- Observation equivalence as a testing equivalence (Q580965) (← links)
- Trace-based verification of imperative programs with I/O (Q617977) (← links)
- Bialgebras for structural operational semantics: an introduction (Q639646) (← links)
- Structural operational semantics for weak bisimulations (Q673123) (← links)
- A process algebraic view of input/output automata (Q674195) (← links)
- Transition system specifications with negative premises (Q685387) (← links)
- Category theory for operational semantics (Q703525) (← links)
- Turing machines, transition systems, and interaction (Q703844) (← links)
- Algebraic specification of agent computation (Q814896) (← links)
- Ready to preorder: an algebraic and general proof (Q843212) (← links)
- Fair testing (Q865623) (← links)
- Conjunction on processes: Full abstraction via ready-tree semantics (Q875513) (← 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)
- CSP is a retract of CCS (Q960852) (← links)
- A precongruence format for should testing preorder (Q974134) (← links)
- The equational theory of prebisimilarity over basic CCS with divergence (Q975471) (← links)
- On the expressibility of priority (Q975534) (← links)
- Ready simulation for concurrency: it's logical! (Q988555) (← links)
- Semantics and expressiveness of ordered SOS (Q1012119) (← links)
- Generating priority rewrite systems for OSOS process languages (Q1012121) (← links)
- (Bi)simulations up-to characterise process semantics (Q1012122) (← links)
- A congruence rule format for name-passing process calculi (Q1012125) (← links)
- Bialgebraic methods and modal logic in structural operational semantics (Q1012126) (← links)
- A conservative look at operational semantics with variable binding (Q1273877) (← links)
- When is partial trace equivalence adequate? (Q1333407) (← links)
- A \(\pi\)-calculus with explicit substitutions (Q1350998) (← links)
- Open maps, behavioural equivalences, and congruences (Q1389441) (← links)
- A general conservative extension theorem in process algebras with inequalities (Q1391791) (← links)
- The power of reachability testing for timed automata (Q1399974) (← links)
- Finite axiom systems for testing preorder and De Simone process languages (Q1575273) (← links)
- Dynamic connectors for concurrency (Q1603689) (← links)
- Compositional SOS and beyond: A coalgebraic view of open systems (Q1603820) (← links)
- Impossible futures and determinism (Q1607117) (← links)
- SOS specifications for uniformly continuous operators (Q1678172) (← links)
- Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity (Q1680509) (← links)
- Rule formats for distributivity (Q1758150) (← links)
- Observational congruences for dynamically reconfigurable tile systems (Q1782000) (← links)