scientific article; zbMATH DE number 1064116
From MaRDI portal
Publication:4355684
zbMATH Open0880.68070MaRDI QIDQ4355684FDOQ4355684
Authors: Bart Jacobs, Jan J. M. M. Rutten 
Publication date: 20 November 1997
Title of this publication is not available (Why is that?)
Recommendations
Cited In (only showing first 100 items - show all)
- Elements of Stream Calculus
- Actors without Directors: A Kahnian View of Heterogeneous Systems
- Bi-inductive structural semantics
- Circular proofs for the Gödel-Löb provability logic
- Computational ludics
- Distributive laws for the coinductive solution of recursive equations
- Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting
- Into the Infinite - Theory Exploration for Coinduction
- Coalgebraic semantics for timed processes
- Foundations for structuring behavioural specifications
- A modal proof theory for final polynomial coalgebras
- A folk model structure on omega-cat
- Synthesis of Reo circuits from scenario-based interaction specifications
- Bialgebraic methods in structural operational semantics (invited talk)
- Recursively defined metric spaces without contraction
- Observational ultraproducts of polynomial coalgebras.
- An approach to innocent strategies as graphs
- Natural duality, modality, and coalgebra
- On equal \(\mu \)-terms
- Equational axiomatizability for coalgebra
- Final Dialgebras: From Categories to Allegories
- Coinduction for exact real number computation
- Title not available (Why is that?)
- A hierarchy of probabilistic system types
- Finitary coalgebraic multisemilattices and multilattices.
- A Brief Overview of PVS
- An approach to object semantics based on terminal co-algebras
- Coalgebras for binary methods: Properties of bisimulations and invariants
- From modal logic to terminal coalgebras
- Coalgebras and monads in the semantics of Java
- Universal coalgebra: A theory of systems
- Terminal metric spaces of finitely branching and image finite linear processes
- Structural operational semantics for continuous state stochastic transition systems
- A Note on Hyperspaces and Terminal Coalgebras
- A coalgebraic semantics of subtyping
- Coinduction for preordered algebra
- Fixpoint semantics and simulation
- Combining a monad and a comonad
- Multigames and strategies, coalgebraically
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Proof-theoretic foundations of normal logic programs
- Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets
- Partition refinement of component interaction automata
- Soundness and completeness proofs by coinductive methods
- Services and Contracts: Coalgebraically
- Non-well-founded trees in categories
- The mechanical generation of fault trees for reactive systems via retrenchment. II. Clocked and feedback circuits
- Symmetries, local names and dynamic (de)-allocation of names
- Approximating and computing behavioural distances in probabilistic transition systems
- Modularity and Implementation of Mathematical Operational Semantics
- From Böhm's Theorem to Observational Equivalences
- Comprehension for coalgebras
- A Complete, Co-inductive Syntactic Theory of Sequential Control and State
- Cut elimination for a logic with induction and co-induction
- Coalgebraic components in a many-sorted microcosm
- Swinging types=functions+relations+transition systems
- Inductive and coinductive components of corecursive functions in Coq
- Probabilistic operational semantics for the lambda calculus
- Final coalgebras and the Hennessy-Milner property
- GSOS for probabilistic transition systems (extended abstract)
- Modal predicates and coequations
- Characterising behavioural equivalence: Three sides of one coin
- From Algebras and Coalgebras to Dialgebras
- Many-sorted coalgebraic modal logic: A model-theoretic study
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- Relating coalgebraic notions of bisimulation. With applications to name-passing process calculi (extended abstract)
- Generalised coinduction
- A transition system semantics for the control-driven coordination language MANIFOLD
- Bi-inductive structural semantics (extended abstract)
- Intuitionistic fixed point logic
- Behavioral abstraction is hiding information
- Object-oriented hybrid systems of coalgebras plus monoid actions
- Efficient Coalgebraic Partition Refinement
- Equivalences and congruences on infinite Conway games
- Systems analysis of life cycle of large-scale information-control systems
- Bialgebraic methods and modal logic in structural operational semantics
- Reversible monadic computing
- A Single Complete Relational Rule for Coalgebraic Refinement
- Modal Operators for Coequations
- CSP, partial automata, and coalgebras.
- On institutions for modular coalgebraic specifications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Observational logic, constructor-based logic, and their duality.
- Using Structural Recursion for Corecursion
- CafeOBJ Traces
- Some properties of coalgebras and their rôle in computer science
- Interactive verification of architectural design patterns in FACTum
- When is a function a fold or an unfold?
- De Bakker-Zucker processes revisited
- Coinduction in Flow: The Later Modality in Fibrations
- Coalgebras as Types Determined by Their Elimination Rules
- A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
- \(p\)-adic physics, non-well-founded reality and unconventional computing
- Fusion of recursive programs with computational effects
- Formalization of Data Flow Computing and a Coinductive Approach to Verifying Flowware Synthesis
- Title not available (Why is that?)
- Minimality Notions via Factorization Systems and Examples
- Title not available (Why is that?)
- From grammars and automata to algebras and coalgebras
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355684)
