Sciweavers

348 search results - page 45 / 70
» Verification of Language Based Fault-Tolerance
Sort
View
BPM
2009
Springer
153views Business» more  BPM 2009»
13 years 9 months ago
DECLARE Demo: A Constraint-based Workflow Management System
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 ...
Maja Pesic, Helen Schonenberg, Wil M. P. van der A...
SIGSOFT
1996
ACM
14 years 19 days ago
Abstracting Dependencies between Software Configuration Items
ing Dependencies between Software Configuration Items CARL A. GUNTER University of Pennsylvania icle studies an abstract model of dependencies between software configuration items ...
Carl A. Gunter
AMAST
2008
Springer
13 years 10 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
POPL
2004
ACM
14 years 8 months ago
A logic you can count on
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...
Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonni...
ECAI
2006
Springer
14 years 5 days ago
Verifying Interlevel Relations Within Multi-Agent Systems
An approach to handle the complex dynamics of a multi-agent system is based on distinguishing aggregation levels by structuring the system into parts or components. The behavior of...
Alexei Sharpanskykh, Jan Treur