81 citations · 108 across the 9 of their papers we have counts for
9 papers
Unambiguous Acceptance of Thin Coalgebras
Anton Chernev, Corina Cîrstea, Helle Hvid Hansen +1
Automata admitting at most one accepting run per structure, known as unambiguous automata, find applications in verification of reactive systems as they extend the class of determi…
Continuation Semantics for Fixpoint Modal Logic and Computation Tree Logics
Ryota Kojima, Corina Cirstea
We introduce continuation semantics for both fixpoint modal logic (FML) and Computation Tree Logic* (CTL*), parameterised by a choice of branching type and quantitative predicate l…
Thin Coalgebraic Behaviours Are Inductive
Anton Chernev, Corina Cîrstea, Helle Hvid Hansen +1
Coalgebras for analytic functors uniformly model graph-like systems where the successors of a state may admit certain symmetries. Examples of successor structure include ordered tu…
Resource-Aware Automata and Games for Optimal Synthesis
Corina Cîrstea
We consider quantitative notions of parity automaton and parity game aimed at modelling resource-aware behaviour, and study (memory-full) strategies for exhibiting accepting runs t…
Linear-time logics -- a coalgebraic perspective
Corina Cirstea
We describe a general approach to deriving linear-time logics for a wide variety of state-based, quantitative systems, by modelling the latter as coalgebras whose type incorporates…
Lattice-Theoretic Progress Measures and Coalgebraic Model Checking (with Appendices)
Ichiro Hasuo, Shunsuke Shimizu, Corina Cirstea
In the context of formal verification in general and model checking in particular, parity games serve as a mighty vehicle: many problems are encoded as parity games, which are then…