Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
Abstract behavior types: a foundation model for components and their composition
Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction
Discrete Event Dynamic Systems
Control of discrete-event systems with modular or distributed structure
Theoretical Computer Science
Brief paper: Supervisory control of modular systems with global specification languages
Automatica (Journal of IFAC)
Coinduction in Concurrent Timed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Linking algebraic observational equivalence and bisimulation
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Pointwise extensions of gsos-defined operations
Mathematical Structures in Computer Science
Partially-Supervised plants: embedding control requirements in plant components
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
| Hi-index | 0.00 |
Coalgebra is used to generalize notions and techniques from concurrency theory, in order to apply them to problems concerning the supervisory control of discrete event systems. The main ingredients of this approach are the characterization of controllability in terms of (a variant of) the notion of bisimulation, and the observation that the family of (partial) languages carries a final coalgebra structure. This allows for a pervasive use of coinductive definition and proof principles, leading to a conceptual unification and simplification and, in a number of cases, to more general and more efficient algorithms.