Sciweavers

342 search results - page 7 / 69
» Coalgebraic Symbolic Semantics
Sort
View
FMCO
2004
Springer
14 years 8 days ago
A Perspective on Component Refinement
Abstract. This paper provides an overview of an approach to coalgebraic modelling and refinement of state-based software components, summing up some basic results and introducing a...
Luís Soares Barbosa
IANDC
2010
102views more  IANDC 2010»
13 years 7 months ago
Presenting functors on many-sorted varieties and applications
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of th...
Alexander Kurz, Daniela Petrisan
ENTCS
2006
161views more  ENTCS 2006»
13 years 8 months ago
Algebraic Specification and Coalgebraic Synthesis of Mealy Automata
We introduce the notion of functional stream derivative, generalising the notion of input derivative of rational expressions (Brzozowski 1964) to the case of stream functions over...
Jan J. M. M. Rutten
FORTE
2001
13 years 10 months ago
A Symbolic Semantics and Bisimulation for Full LOTOS
A symbolic semantics for Full LOTOS in terms of symbolic transition systems is defined; the semantics extends the (infinitely branching) standard semantics by giving meaning to da...
Muffy Calder, Carron Shankland
CORR
2011
Springer
222views Education» more  CORR 2011»
13 years 3 months ago
Generic Trace Logics
Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...
Christian Kissig, Alexander Kurz