114 search results - page 14 / 23 » Symbolic computation of differential equivalences |
ATVA
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
VLDB
2008
ACM
14 years 10 months ago
2008
ACM
Mapping composition is a fundamental operation in metadata driven applications. Given a mapping over schemas 1 and 2 and a mapping over schemas 2 and 3, the composition problem is...
WSC
1997
13 years 11 months ago
1997
This paper studies activity cycle diagrams (ACD) for modeling construction processes using activities as the basic elements. An ACD is obtained by combining the activity cycles of...
ENTCS
2006
13 years 9 months ago
2006
In Rutten [13] the theoretical basis was given for the synthesis of binary Mealy machines from specifications in 2-adic arithmetic. This construction is based on the symbolic comp...
JOLLI
2007
13 years 9 months ago
2007
Every pregroup grammar is shown to be strongly equivalent to one which uses basic types and left and right adjoints of basic types only. Therefore a semantical interpretation is i...