Add to ORKGCoalgebraic techniques allow for a very natural models of various types of state based systems. We propose and discuss a specification language which can be used to formulate µ-calculus like assertions regarding the behaviour of systems modelled coalgebraically. We also report a case study indicating, that verification times can sometimes be drastically reduced if one uses coalgebraic techniques
We consider state-based systems modelled as coalgebras whose type incorporates branching, and show t...
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled trans...
Coalgebraic specification and semantics, as used earlier for object-oriented programming, is extende...
AbstractWe present an extension of standard coalgebraic specification techniques for state based sys...
This thesis is about coalgebraic methods in software specification and verification. It extends know...
This thesis is about coalgebraic methods in software specification and verification. It extends know...
This thesis is about coalgebraic methods in software specification and verification. It extends know...
AbstractWe present an algebraic extension of standard coalgebraic specification techniques for state...
This thesis is about coalgebraic methods in software specification and verification. It extends know...
AbstractThis paper gives an overview of recent results concerning the modular derivation of (i) moda...
We present an algebraic extension of standard coalgebraic specification techniques for statebased sy...
We present an algebraic extension of standard coalgebraic specification techniques for statebased sy...
We consider state-based systems modelled as coalgebras whose type incorporates branching, and show t...
AbstractThe Cone of Influence Reduction is a fundamental abstraction technique for reducing the size...
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled trans...
We consider state-based systems modelled as coalgebras whose type incorporates branching, and show t...
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled trans...
Coalgebraic specification and semantics, as used earlier for object-oriented programming, is extende...
AbstractWe present an extension of standard coalgebraic specification techniques for state based sys...
This thesis is about coalgebraic methods in software specification and verification. It extends know...
This thesis is about coalgebraic methods in software specification and verification. It extends know...
This thesis is about coalgebraic methods in software specification and verification. It extends know...
AbstractWe present an algebraic extension of standard coalgebraic specification techniques for state...
This thesis is about coalgebraic methods in software specification and verification. It extends know...
AbstractThis paper gives an overview of recent results concerning the modular derivation of (i) moda...
We present an algebraic extension of standard coalgebraic specification techniques for statebased sy...
We present an algebraic extension of standard coalgebraic specification techniques for statebased sy...
We consider state-based systems modelled as coalgebras whose type incorporates branching, and show t...
AbstractThe Cone of Influence Reduction is a fundamental abstraction technique for reducing the size...
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled trans...
We consider state-based systems modelled as coalgebras whose type incorporates branching, and show t...
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled trans...
Coalgebraic specification and semantics, as used earlier for object-oriented programming, is extende...