On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Executable Protocol Specification in ESL
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Compositional Synthesis of Generalized Mealy Machines
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Introduction to Logic Design with CD ROM
Introduction to Logic Design with CD ROM
Presenting functors by operations and equations
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Duality for logics of transition systems
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
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
Coalgebraic components in a many-sorted microcosm
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Quantitative Kleene coalgebras
Information and Computation
Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds to a finite formula in the language. For the converse, we give a compositional synthesis algorithm which transforms every formula into a finite Mealy machine whose behaviour is exactly the set of causal functions satisfying the formula.