The following pages link to (Q4355684):
Displaying 50 items.
- Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets (Q328657) (← links)
- Systems analysis of life cycle of large-scale information-control systems (Q386928) (← links)
- Foundations for structuring behavioural specifications (Q406465) (← links)
- An approach to innocent strategies as graphs (Q418201) (← links)
- Natural duality, modality, and coalgebra (Q418910) (← links)
- The mechanical generation of fault trees for reactive systems via retrenchment. II. Clocked and feedback circuits (Q470020) (← links)
- Computational ludics (Q534713) (← links)
- Synthesis of Reo circuits from scenario-based interaction specifications (Q541679) (← links)
- On equal \(\mu \)-terms (Q549186) (← links)
- Symmetries, local names and dynamic (de)-allocation of names (Q618165) (← links)
- Coinduction for preordered algebra (Q627121) (← links)
- A hierarchy of probabilistic system types (Q703518) (← links)
- Behavioral abstraction is hiding information (Q703529) (← links)
- Non-well-founded trees in categories (Q876383) (← links)
- Multigames and strategies, coalgebraically (Q890378) (← links)
- A folk model structure on omega-cat (Q973942) (← links)
- Bialgebraic methods and modal logic in structural operational semantics (Q1012126) (← links)
- Bi-inductive structural semantics (Q1012127) (← links)
- Coinduction for exact real number computation (Q1015372) (← links)
- Terminal metric spaces of finitely branching and image finite linear processes (Q1128985) (← links)
- Observational ultraproducts of polynomial coalgebras. (Q1408860) (← links)
- A transition system semantics for the control-driven coordination language MANIFOLD (Q1575145) (← links)
- Fixpoint semantics and simulation (Q1575253) (← links)
- Object-oriented hybrid systems of coalgebras plus monoid actions (Q1575271) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- Universal coalgebra: A theory of systems (Q1583483) (← links)
- CSP, partial automata, and coalgebras. (Q1603814) (← links)
- On institutions for modular coalgebraic specifications. (Q1603816) (← links)
- Combining a monad and a comonad (Q1603819) (← links)
- \(p\)-adic physics, non-well-founded reality and unconventional computing (Q1760203) (← links)
- Undecidability of equality for codata types (Q1798783) (← links)
- Coalgebras and monads in the semantics of Java (Q1853752) (← links)
- Observational logic, constructor-based logic, and their duality. (Q1874280) (← links)
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series (Q1884876) (← links)
- De Bakker-Zucker processes revisited (Q1887161) (← links)
- Cut elimination for a logic with induction and co-induction (Q1948276) (← links)
- Partition refinement of component interaction automata (Q1951613) (← links)
- Bisimulation for probabilistic transition systems: A coalgebraic approach (Q1960528) (← links)
- Non-well-founded deduction for induction and coinduction (Q2055840) (← links)
- Integrating induction and coinduction via closure operators and proof cycles (Q2096458) (← links)
- Intuitionistic fixed point logic (Q2220485) (← links)
- Finitary coalgebraic multisemilattices and multilattices. (Q2249004) (← links)
- Interactive verification of architectural design patterns in FACTum (Q2335950) (← links)
- Structural operational semantics for continuous state stochastic transition systems (Q2341700) (← links)
- Circular proofs for the Gödel-Löb provability logic (Q2343897) (← links)
- Soundness and completeness proofs by coinductive methods (Q2362498) (← links)
- Recursively defined metric spaces without contraction (Q2373743) (← links)
- A description based on languages of the final non-deterministic automaton (Q2449045) (← links)
- Distributive laws for the coinductive solution of recursive equations (Q2495644) (← links)
- Coalgebraic semantics for timed processes (Q2495646) (← links)
