Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Some fundamental algebraic tools for the semantics of computation, part 3: indexed categories
Theoretical Computer Science
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking
Unifying Theories in Different Institutions
Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification
A Simple Characterization of Stuttering Bisimulation
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
Theoroidal maps as algebraic simulations
WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques
Strategies and simulations in a semantic framework
Journal of Algorithms
Algebraic Stuttering Simulations
Electronic Notes in Theoretical Computer Science (ENTCS)
A heterogeneous approach to service-oriented systems specification
Proceedings of the 2010 ACM Symposium on Applied Computing
State space reduction of rewrite theories using invisible transitions
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Hi-index | 0.00 |
Simulations are a very natural way of relating concurrent systems, which are mathematically modeled by Kripke structures. The range of available notions of simulations makes it very natural to adopt a categorical viewpoint in which Kripke structures become the objects of several categories while the morphisms are obtained from the corresponding notion of simulation. Here we define in detail several of those categories, collect them together in various institutions, and study their most interesting properties.