Pages that link to "Item:Q3118994"
From MaRDI portal
The following pages link to Introduction to Bisimulation and Coinduction (Q3118994):
Displaying 50 items.
- Structural congruence for bialgebraic semantics (Q338626) (← links)
- Relational properties of sequential composition of coalgebras (Q406463) (← links)
- Lattice-valued simulations for quantitative transition systems (Q473367) (← links)
- Impossibility of gathering, a certification (Q483063) (← links)
- A generic framework for symbolic execution: a coinductive approach (Q507361) (← links)
- A language-independent proof system for full program equivalence (Q510898) (← links)
- Flag-based big-step semantics (Q516041) (← links)
- A general account of coinduction up-to (Q523132) (← links)
- Behavioural equivalences for coalgebras with unobservable moves (Q890618) (← links)
- Towards a process calculus for REST: current state of the art (Q902704) (← links)
- Bisimulation indexes and their applications (Q1606119) (← links)
- Virtually timed ambients: a calculus of nested virtualization (Q1683706) (← links)
- A formalisation of consistent consequence for Boolean equation systems (Q1687766) (← links)
- (Co)inductive proof systems for compositional proofs in reachability logic (Q1996855) (← links)
- The \(C_\pi\)-calculus: a model for confidential name passing (Q1996859) (← links)
- A logical and graphical framework for reaction systems (Q2034775) (← links)
- Transactions and contracts based on reaction systems (Q2044946) (← links)
- Processes against tests: on defining contextual equivalences (Q2079681) (← links)
- On bidirectional runtime enforcement (Q2117010) (← links)
- Coupled similarity: the first 32 years (Q2182667) (← links)
- Team equivalences for finite-state machines with silent moves (Q2216117) (← links)
- Unique solutions of contractions, CCS, and their HOL formalisation (Q2216120) (← links)
- A constraint-based language for multiparty interactions (Q2229145) (← links)
- Team bisimilarity, and its associated modal logic, for BPP nets (Q2231652) (← links)
- Fixpoint theory -- upside down (Q2233395) (← links)
- Limited approximate bisimulations and the corresponding rough approximations (Q2237122) (← links)
- A characterization of Moessner's sieve (Q2253190) (← links)
- Bisimulation and coinduction enhancements: a historical perspective (Q2280213) (← links)
- Models and emerging trends of concurrent constraint programming (Q2348541) (← links)
- Verification of finite-state machines: a distributed approach (Q2413026) (← links)
- Depletable channels: dynamics, behaviour, and efficiency in network design (Q2422775) (← links)
- SOS rule formats for idempotent terms and idempotent unary operators (Q2436519) (← links)
- Fairness and communication-based semantics for session-typed languages (Q2672270) (← links)
- Coinductive counting: bisimulation in enumerative combinatorics (extended abstract) (Q2842562) (← links)
- Probabilistic operational semantics for the lambda calculus (Q2905328) (← links)
- Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract) (Q2942772) (← links)
- Weak Bisimulation as a Congruence in MSOS (Q2945724) (← links)
- (Q3121518) (← links)
- (Q3121528) (← links)
- (Q3145858) (← links)
- Cathoristic Logic (Q3297837) (← links)
- Distributed Modal Logic (Q3305433) (← links)
- How to Reason Coinductively Informally (Q3305562) (← links)
- (Q3384919) (← links)
- Applicative Bisimulation and Quantum λ-Calculi (Q3455863) (← links)
- Trees from Functions as Processes (Q4585071) (← links)
- Productive corecursion in logic programming (Q4592714) (← links)
- (Q5009452) (← links)
- (Q5020616) (← links)
- (Q5020946) (← links)