Sciweavers

941 search results - page 159 / 189
» History-Dependent Petri Nets
Sort
View
FSTTCS
2006
Springer
13 years 11 months ago
On Decidability of LTL Model Checking for Process Rewrite Systems
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
Laura Bozzelli, Mojmír Kretínsk&yacu...
ACSAC
2003
IEEE
13 years 11 months ago
Modeling of Multiple Agent based Cryptographic Key Recovery Protocol
When a receiver of a ciphertext message can not decrypt the message due to the fact that he has lost his private-key, the private-key of the receiver and session-key of the messag...
Shinyoung Lim, Sangseung Kang, Joo-Chan Sohn
FOSSACS
2000
Springer
13 years 11 months ago
On Recognizable Stable Trace Languages
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
Jean-François Husson, Rémi Morin
KDD
1995
ACM
128views Data Mining» more  KDD 1995»
13 years 11 months ago
Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach
The main objective of machine discovery is the determination of relations between data and of data models. In the paper we describe a method for discovery of data models represent...
Andrzej Skowron, Zbigniew Suraj
BPM
2008
Springer
136views Business» more  BPM 2008»
13 years 9 months ago
On the Formal Generation of Process Redesigns
Business Process Redesign (BPR) is a process oriented methodology to improve organizations. Although literature on BPR is available in abundance, little concrete support on how to ...
Mariska Netjes, Hajo A. Reijers, Wil M. P. van der...