scientific article; zbMATH DE number 1064116
From MaRDI portal
Publication:4355684
zbMath0880.68070MaRDI QIDQ4355684
Bart Jacobs, Jan J. M. M. Rutten
Publication date: 20 November 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Observational logic, constructor-based logic, and their duality. ⋮ Soundness and completeness proofs by coinductive methods ⋮ A Note on Hyperspaces and Terminal Coalgebras ⋮ Coalgebraic Components in a Many-Sorted Microcosm ⋮ Characterising Behavioural Equivalence: Three Sides of One Coin ⋮ Relating Coalgebraic Notions of Bisimulation ⋮ Equivalences and Congruences on Infinite Conway Games ⋮ Data Intensive Distributed Computing in Data Aware Self-organizing Networks ⋮ Minimality Notions via Factorization Systems and Examples ⋮ Behavioural differential equations: a coinductive calculus of streams, automata, and power series ⋮ De Bakker-Zucker processes revisited ⋮ Recursively defined metric spaces without contraction ⋮ Probabilistic operational semantics for the lambda calculus ⋮ A Complete, Co-inductive Syntactic Theory of Sequential Control and State ⋮ Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets ⋮ Unnamed Item ⋮ Some properties of coalgebras and their rôle in computer science ⋮ Non-well-founded trees in categories ⋮ Terminal metric spaces of finitely branching and image finite linear processes ⋮ Systems analysis of life cycle of large-scale information-control systems ⋮ Multigames and strategies, coalgebraically ⋮ Symmetries, local names and dynamic (de)-allocation of names ⋮ Foundations for structuring behavioural specifications ⋮ Formalization of Data Flow Computing and a Coinductive Approach to Verifying Flowware Synthesis ⋮ Coinduction for preordered algebra ⋮ An approach to innocent strategies as graphs ⋮ Natural duality, modality, and coalgebra ⋮ Observational ultraproducts of polynomial coalgebras. ⋮ Cut elimination for a logic with induction and co-induction ⋮ Partition refinement of component interaction automata ⋮ Bisimulation for probabilistic transition systems: A coalgebraic approach ⋮ Intuitionistic fixed point logic ⋮ A description based on languages of the final non-deterministic automaton ⋮ The mechanical generation of fault trees for reactive systems via retrenchment. II. Clocked and feedback circuits ⋮ A Brief Overview of PVS ⋮ A Single Complete Relational Rule for Coalgebraic Refinement ⋮ Timing-Sensitive Noninterference through Composition ⋮ Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study ⋮ A Coalgebraic Semantics of Subtyping ⋮ Coalgebras for Binary Methods: Properties of Bisimulations and Invariants ⋮ Finitary coalgebraic multisemilattices and multilattices. ⋮ Unnamed Item ⋮ From Böhm's Theorem to Observational Equivalences ⋮ Generalised Coinduction ⋮ When is a function a fold or an unfold? ⋮ Modal Operators for Coequations ⋮ From Algebras and Coalgebras to Dialgebras ⋮ Elements of Stream Calculus ⋮ Modularity and Implementation of Mathematical Operational Semantics ⋮ Computational ludics ⋮ \(p\)-adic physics, non-well-founded reality and unconventional computing ⋮ Synthesis of Reo circuits from scenario-based interaction specifications ⋮ On equal \(\mu \)-terms ⋮ A hierarchy of probabilistic system types ⋮ Behavioral abstraction is hiding information ⋮ A folk model structure on omega-cat ⋮ Distributive laws for the coinductive solution of recursive equations ⋮ Coalgebraic semantics for timed processes ⋮ Final Dialgebras: From Categories to Allegories ⋮ A modal proof theory for final polynomial coalgebras ⋮ Approximating and computing behavioural distances in probabilistic transition systems ⋮ Undecidability of equality for codata types ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Actors without Directors: A Kahnian View of Heterogeneous Systems ⋮ Bialgebraic methods and modal logic in structural operational semantics ⋮ Bi-inductive structural semantics ⋮ Coinduction for exact real number computation ⋮ Non-well-founded deduction for induction and coinduction ⋮ Using Structural Recursion for Corecursion ⋮ Two extensions of system F with (co)iteration and primitive (co)recursion principles ⋮ A transition system semantics for the control-driven coordination language MANIFOLD ⋮ Fixpoint semantics and simulation ⋮ Object-oriented hybrid systems of coalgebras plus monoid actions ⋮ Swinging types=functions+relations+transition systems ⋮ GSOS for probabilistic transition systems ⋮ Comprehension for Coalgebras ⋮ Modal Predicates and Coequations ⋮ Towards Behavioral Maude ⋮ A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras ⋮ Efficient Coalgebraic Partition Refinement ⋮ Universal coalgebra: A theory of systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Interactive verification of architectural design patterns in FACTum ⋮ Integrating induction and coinduction via closure operators and proof cycles ⋮ Final coalgebras and the Hennessy-Milner property ⋮ Coalgebras and monads in the semantics of Java ⋮ Structural operational semantics for continuous state stochastic transition systems ⋮ Circular proofs for the Gödel-Löb provability logic ⋮ Bialgebraic Methods in Structural Operational Semantics ⋮ Co-Algebraic Models for Quantitative Spatial Logics ⋮ Bi-inductive Structural Semantics ⋮ CSP, partial automata, and coalgebras. ⋮ On institutions for modular coalgebraic specifications. ⋮ Combining a monad and a comonad ⋮ Inductive and Coinductive Components of Corecursive Functions in Coq ⋮ Regular Strategies as Proof Tactics for CIRC ⋮ Expander2: Program Verification Between Interaction and Automation
Uses Software
This page was built for publication:
