17 search results - page 3 / 4 » Team Automata Satisfying Compositionality |
JCST
2008
13 years 7 months ago
2008
Transformational approaches to generating design and implementation models from requirements can bring effectiveness and quality to software development. In this paper we present a...
TACAS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to ver...
POPL
2004
ACM
14 years 7 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
SOFSEM
2012
Springer
12 years 2 months ago
2012
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification against all environments. While modelchecking theory has led to...
COCO
2008
Springer
13 years 9 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...