Sciweavers

456 search results - page 25 / 92
» The Logical Execution Time Paradigm
Sort
View
BIS
2007
183views Business» more  BIS 2007»
13 years 10 months ago
A Conceptual Framework for Composition in Business Process Management
In this work, we present a conceptual framework for deriving executable business process models from high-level, graphical business process models based on the paradigm of Service-...
Ingo Weber, Ivan Markovic, Christian Drumm
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
14 years 27 days ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
HPCA
2004
IEEE
14 years 9 months ago
Reducing the Scheduling Critical Cycle Using Wakeup Prediction
For highest performance, a modern microprocessor must be able to determine if an instruction is ready in the same cycle in which it is to be selected for execution. This creates a...
Todd E. Ehrhart, Sanjay J. Patel
FMSD
2006
131views more  FMSD 2006»
13 years 8 months ago
Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude
This paper describes the application of the Real-Time Maude tool and the Maude formal methodology to the specification and analysis of the AER/NCA suite of active network multicast...
Peter Csaba Ölveczky, José Meseguer, C...
TAPSOFT
1997
Springer
14 years 1 months ago
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
Danièle Beauquier, Anatol Slissenko