1705 search results - page 89 / 341 » Representing Constraints with Automata |
FOSSACS
2006
Springer
15 years 1 months ago
2006
Springer
A smooth orchestrator is a process with several alternative branches, every one defining synchronizations among co-located channels. Smooth orchestrators constitute a basic mechani...
FMCO
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we present a framework for formal modeling and verification of service-based business processes with focus on their compliance to external regulations such as Segreg...
ENTCS
2006
14 years 10 months ago
2006
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
COMCOM
2000
14 years 9 months ago
2000
This paper is devoted to the presentation of the RT-LOTOS formal description technique, which is a formalism suited for applications where concurrency, complex synchronization pat...
173
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
We present an implementation of table constraints in CLP(FD). For binary constraints, the supports of each value are represented as a finite-domain variable, and action rules are u...