Sciweavers

2873 search results - page 377 / 575
» Model Checking and the Mu-calculus
Sort
View
BPM
2005
Springer
129views Business» more  BPM 2005»
14 years 1 months ago
Transforming BPEL to Petri Nets
We present a Petri net semantics for the Business Process Execution Language for Web Services (BPEL). Our semantics covers the standard behaviour of BPEL as well as the exceptional...
Sebastian Hinz, Karsten Schmidt 0004, Christian St...
EMSOFT
2005
Springer
14 years 1 months ago
Model-based analysis of distributed real-time embedded system composition
Key challenges in distributed real-time embedded (DRE) system developments include safe composition of system components and mapping the functional specifications onto the target...
Gabor Madl, Sherif Abdelwahed
ISW
2005
Springer
14 years 1 months ago
Universally Composable Time-Stamping Schemes with Audit
Abstract. We present a universally composable time-stamping scheme based on universal one-way hash functions. The model we use contains an ideal auditing functionality (implementab...
Ahto Buldas, Peeter Laud, Märt Saarepera, Jan...
CAV
2004
Springer
96views Hardware» more  CAV 2004»
14 years 1 months ago
Widening Arithmetic Automata
Model checking of infinite state systems is undecidable, therefore, there are instances for which fixpoint computations used in infinite state model checkers do not converge. Gi...
Constantinos Bartzis, Tevfik Bultan
IPPS
2003
IEEE
14 years 1 months ago
Task Graph Scheduling Using Timed Automata
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
Yasmina Abdeddaïm, Abdelkarim Kerbaa, Oded Ma...