Sciweavers

2050 search results - page 180 / 410
» A formal foundation for process modeling
Sort
View
ENTCS
2007
78views more  ENTCS 2007»
15 years 6 months ago
PEPA Queues: Capturing Customer Behaviour in Queueing Networks
Queueing network formalisms are very good at describing the spatial movement of customers, but typically poor at describing how customers change as they move through the network. ...
Ashok Argent-Katwala, Jeremy T. Bradley
CBMS
2006
IEEE
16 years 19 days ago
An Ontology-Driven Mediator for Querying Time-Oriented Biomedical Data
— Most biomedical research databases contain considerable amounts of time-oriented data. However, temporal knowledge about the contextual meaning of such data is not usually repr...
Martin J. O'Connor, Ravi Shankar, Amar K. Das
DAM
2006
121views more  DAM 2006»
15 years 6 months ago
Fine-grained forward-secure signature schemes without random oracles
We propose the concept of fine-grained forward-secure signature schemes. Such signature schemes not only provide non-repudiation w.r.t. past time periods the way ordinary forward-...
Jan Camenisch, Maciej Koprowski
ENTCS
2006
173views more  ENTCS 2006»
15 years 6 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal
FIW
2009
166views Communications» more  FIW 2009»
15 years 4 months ago
Feature Interactions in a Software Product Line for E-voting
A significant number of failures in e-voting systems have arisen because of poorly specified requirements, combined with an ad-hoc approach to engineering multiple variations of si...
J. Paul Gibson, Eric Lallet, Jean-Luc Raffy