Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages

@inproceedings{Dorsch2018PredicateLA,
  title={Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages},
  author={Ulrich Dorsch and Stefan Milius and Lutz Schr{\"o}der and Thorsten Wi{\ss}mann},
  booktitle={CMCS},
  year={2018}
}
  • Ulrich Dorsch, Stefan Milius, +1 author Thorsten Wißmann
  • Published in CMCS 2018
  • Mathematics, Computer Science
  • We introduce a generic expression language describing behaviours of finite coalgebras over sets; besides relational systems, this covers, e.g., weighted, probabilistic, and neighbourhood-based system types. We prove a generic Kleene-type theorem establishing a correspondence between our expressions and finite systems. Our expression language is similar to one introduced in previous work by Myers but has a semantics defined in terms of a particular form of predicate liftings as used in… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    1
    Twitter Mention

    Topics from this paper.

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 39 REFERENCES

    Lax extensions of coalgebra functors and their logic

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Rational Coalgebraic Machines in Varieties: Languages, Completeness and Automatic Proofs

    • R. Myers
    • Ph.D. thesis, Imperial College London
    • 2013
    VIEW 12 EXCERPTS
    HIGHLY INFLUENTIAL

    Monoid-labeled transition systems

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Non-Deterministic Kleene Coalgebras

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    EXPTIME tableaux for the coalgebraic µ-calculus

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Equational Coalgebraic Logic

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Modal Logics are Coalgebraic

    VIEW 1 EXCERPT

    General theory of relational automata

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Subsumption Checking in Conjunctive Coalgebraic Fixpoint Logics

    VIEW 1 EXCERPT