1705 search results - page 124 / 341 » Representing Constraints with Automata |
128
click to vote
PARA
1995
Springer
15 years 8 months ago
1995
Springer
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
166
click to vote
FAC
2008
15 years 4 months ago
2008
This paper describes the Mondex case study with UML class diagrams and restricting OCL constraints. The constraints have been formulated either as OCL class invariants or as OCL pr...
155
click to vote
LATA
2009
Springer
15 years 11 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
140
click to vote
FOSSACS
2005
Springer
15 years 10 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
145
click to vote
PODC
1999
ACM
15 years 8 months ago
1999
ACM
We present a new approach for reasoning about liveness properties of distributed systems, represented as automata. Our approach is based on simulation relations, and requires reas...