A co-induction principle for recursively defined domains
Theoretical Computer Science
Forward and backward simulations I.: untimed systems
Information and Computation
Fixpoint semantics and simulation
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
A Coalgebraic presentation of structured transition systems
Theoretical Computer Science
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Exercises in coalgebraic specification
Algebraic and coalgebraic methods in the mathematics of program construction
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
The temporal logic of coalgebras via Galois algebras
Mathematical Structures in Computer Science
Processes as formal power series: a coinductive approach to denotational semantics
Theoretical Computer Science
Simulations Up-to and Canonical Preorders
Electronic Notes in Theoretical Computer Science (ENTCS)
Constrained Simulations, Nested Simulation Semantics and Counting Bisimulations
Electronic Notes in Theoretical Computer Science (ENTCS)
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
(Bi)simulations up-to characterise process semantics
Information and Computation
Reflection and preservation of properties in coalgebraic (bi)simulations
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Formalization of data flow computing and a coinductive approach to verifying flowware synthesis
Transactions on computational science I
Non-strongly stable orders also define interesting simulation relations
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Generic forward and backward simulations II: probabilistic simulation
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
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
Relation liftings on preorders and posets
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Logics for contravariant simulations
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Generic forward and backward simulations
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
A Characterisation of Expressivity for Coalgebraic Bisimulation and Simulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Unifying Equivalences for Higher Dimensional Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Weak bisimulations for coalgebras over ordered functors
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Generalizing simulation to abstract domains
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hi-index | 0.00 |
A new approach to simulations is proposed within the theory of coalgebras by taking a notion of order on a functor as primitive. Such an order forms a basic building block for a "lax relation lifting", or "relator" as used by other authors. Simulations appear as coalgebras of this lifted functor, and similarity as greatest simulation. Two-way similarity is then similarity in both directions. In general, it is different from bisimilarity (in the usual coalgebraic sense), but a sufficient condition is formulated (and illustrated) to ensure that bisimilarity and two-way similarity coincide. Also, suitable conditions are identified which ensures that similarity on a final coalgebra forms an (algebraic) dcpo structure. This involves a close investigation of the iterated applications Fn(0) and Fn(1) of a functor F with an order to the initial algebras and final objects.