1705 search results - page 48 / 341 » Representing Constraints with Automata |
ATVA
2004
Springer
14 years 1 months ago
2004
Springer
Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, ...
IJFCS
2006
13 years 7 months ago
2006
ion for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, Graduate School of Information Science...
BPM
2007
Springer
14 years 1 months ago
2007
Springer
In a service composition, it is necessary to ensure that the behaviour of a constituent service is consistent with the requirements of the composition. In an adaptive service compo...
CSCLP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We propose to use bilattice as a constraint valuation structure in order to represent truth and belief at the same time. A bilattice is a set which owns two lattices orde...
ADBIS
2009
Springer
14 years 2 months ago
2009
Springer
We propose linear systems of hedge language equations (LSH) as a formalism to represent regular hedge languages. These linear systems are suitable for several computations in the a...