Bialgebraic Modelling of Timed Processes
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Semantical Principles in the Modal Logic of Coalgebras
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
Mathematical Structures in Computer Science
Final coalgebras as greatest fixed points in ZF set theory
Mathematical Structures in Computer Science
Coinductive characterizations of applicative structures
Mathematical Structures in Computer Science
Hidden coinduction: behavioural correctness proofs for objects
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
On tree coalgebras and coalgebra presentations
Theoretical Computer Science
Theoretical Computer Science - Logic, semantics and theory of programming
A hierarchy of probabilistic system types
Theoretical Computer Science - Selected papers of CMCS'03
Operations and equations for coalgebras
Mathematical Structures in Computer Science
A coinductive calculus of streams
Mathematical Structures in Computer Science
A comonadic account of behavioural covarieties of coalgebras
Mathematical Structures in Computer Science
A general final coalgebra theorem
Mathematical Structures in Computer Science
Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction
Discrete Event Dynamic Systems
On the final sequence of a finitary set functor
Theoretical Computer Science
A behavioural pseudometric for metric labelled transition systems
CONCUR 2005 - Concurrency Theory
A tutorial on coinductive stream calculus and signal flow graphs
Theoretical Computer Science - Formal methods for components and objects
Terminal coalgebras and free iterative theories
Information and Computation
A modal proof theory for final polynomial coalgebras
Theoretical Computer Science
Coalgebraic description of generalised binary methods
Mathematical Structures in Computer Science
Services and Contracts: Coalgebraically
Electronic Notes in Theoretical Computer Science (ENTCS)
Functional pearl: streams and unique fixed points
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
New Bisimulation Semantics for Distributed Systems
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Calculating Invariants as Coreflexive Bisimulations
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Using coalgebra and coinduction to define ontology-based multi-agent systems
International Journal of Metadata, Semantics and Ontologies
Bialgebraic methods and modal logic in structural operational semantics
Information and Computation
A Kleene Theorem for Polynomial Coalgebras
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Modeling Fresh Names in the π-calculus Using Abstractions
Electronic Notes in Theoretical Computer Science (ENTCS)
A Coalgebraic Perspective on Monotone Modal Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
A Coalgebraic Approach to Process Equivalence and a Coinduction Principle for Traces
Electronic Notes in Theoretical Computer Science (ENTCS)
Predicate and Relation Lifting for Parametric Algebraic Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Weak Bisimulation for Action-Type Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Coalgebraic Description of Generalized Binary Methods
Electronic Notes in Theoretical Computer Science (ENTCS)
The converse of a stochastic relation
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Reflection and preservation of properties in coalgebraic (bi)simulations
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Characterising behavioural equivalence: three sides of one coin
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Relating coalgebraic notions of bisimulation: with applications to name-passing process calculi
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Non-strongly stable orders also define interesting simulation relations
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Bisimulations Generated from Corecursive Equations
Electronic Notes in Theoretical Computer Science (ENTCS)
CEFP'09 Proceedings of the Third summer school conference on Central European functional programming school
Pointwise extensions of gsos-defined operations
Mathematical Structures in Computer Science
Similarity quotients as final coalgebras
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Finitary functors: from set to preord and poset
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Indexed induction and coinduction, fibrationally
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Scans and convolutions: a calculational proof of Moessner's theorem
IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
Realization of Coinductive Types
Electronic Notes in Theoretical Computer Science (ENTCS)
A perspective on component refinement
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Algebraic and coalgebraic aspects of membrane computing
WMC'05 Proceedings of the 6th international conference on Membrane Computing
A categorical view of timed weak bisimulation
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
From T-coalgebras to filter structures and transition systems
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
The least fibred lifting and the expressivity of coalgebraic modal logic
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Bireachability and final multialgebras
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Modalities in the Stone age: A comparison of coalgebraic logics
Theoretical Computer Science
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Unifying Equivalences for Higher Dimensional Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Preorders on monads and coalgebraic simulations
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Coalgebras for Fuzzy Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |