Sciweavers

1511 search results - page 19 / 303
» Event Processing - past, present and future
Sort
View
LICS
2008
IEEE
15 years 8 months ago
On the Axiomatizability of Impossible Futures: Preorder versus Equivalence
We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We prove that no finite, sound axiomatization for BCCSP modulo impossible...
Taolue Chen, Wan Fokkink
USENIX
2001
15 years 3 months ago
Kqueue - A Generic and Scalable Event Notification Facility
Applications running on a UNIX platform need to be notified when some activity occurs on a socket or other descriptor, and this is traditionally done with the select() or poll() s...
Jonathan Lemon
95
Voted
WSC
1998
15 years 3 months ago
Architecture for a Non-deterministic Simulation Machine
Causality constraints of random discrete simulation make parallel and distributed processing difficult. Methods of applying reconfigurable logic to implement and accelerate simula...
Marc Bumble, Lee D. Coraor
105
Voted
CAISE
2003
Springer
15 years 7 months ago
Computing Event Dependencies in System Designs and Programs
Abstract. This paper presents a method to compute metrics that predict maintainability of a system with respect to its event processing. The metrics reflect the complexity of event...
Bruc Lee Liong, Leszek A. Maciaszek
BPM
2008
Springer
136views Business» more  BPM 2008»
15 years 3 months ago
A Region-Based Algorithm for Discovering Petri Nets from Event Logs
The paper presents a new method for the synthesis of Petri nets from event logs in the area of Process Mining. The method derives a bounded Petri net that over-approximates the beh...
Josep Carmona, Jordi Cortadella, Michael Kishinevs...