Sciweavers

63 search results - page 4 / 13
» Complementation of Coalgebra Automata
Sort
View
STACS
1999
Springer
15 years 1 months ago
The Weakness of Self-Complementation
Model checking is a method for the verification of systems with respect to their specifications. Symbolic model-checking, which enables the verification of large systems, procee...
Orna Kupferman, Moshe Y. Vardi
IANDC
2006
121views more  IANDC 2006»
14 years 9 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
ENTCS
2006
161views more  ENTCS 2006»
14 years 9 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
ENTCS
2008
84views more  ENTCS 2008»
14 years 9 months ago
Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...
Bart Jacobs