13 search results - page 2 / 3 » An automata-theoretic approach to constraint LTL |
SPIN
2010
Springer
13 years 2 months ago
2010
Springer
In our earlier work we have proposed using the declarative language DecSerFlow for modeling, analysis and enactment of processes in autonomous web services. DecSerFlow uses constra...
ATAL
2010
Springer
13 years 5 months ago
2010
Springer
An organizational modeling language can be used to specify an agent organization in terms of its roles, organizational structure, norms, etc. Such an organizational specification ...
STACS
2001
Springer
13 years 9 months ago
2001
Springer
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...
RISE
2004
Springer
13 years 10 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
BPM
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. Mainstream workflow management systems are using procedural languages ranging from BPMN and EPCs to BPEL and YAWL. By demonstrating DECLARE, we will show that it is also ...