Sciweavers

4485 search results - page 28 / 897
» Equivalences on Observable Processes
Sort
View
ENTCS
2007
105views more  ENTCS 2007»
13 years 8 months ago
A Probabilistic Scheduler for the Analysis of Cryptographic Protocols
When modelling cryto-protocols by means of process calculi which express both nondeterministic and probabilistic behavior, it is customary to view the scheduler as an intruder. It...
Srecko Brlek, Sardaouna Hamadou, John Mullins
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
14 years 2 months ago
Model Checking on Trees with Path Equivalences
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Rajeev Alur, Pavol Cerný, Swarat Chaudhuri
IROS
2009
IEEE
148views Robotics» more  IROS 2009»
14 years 3 months ago
Cue-based equivalence classes and incremental discrimination for multi-cue recognition of "interactionable" objects
— There is a subset of objects for which interaction can provide numerous cues to those objects’ identity. Robots are often in situations where they can take advantage being ab...
Sarah Aboutalib, Manuela M. Veloso
GG
2008
Springer
13 years 9 months ago
Network Applications of Graph Bisimulation
Abstract Synchronising Graphs is a system of parallel graph transformation designed for modeling process interaction in a network environment. We propose a theory of context-free s...
Pietro Cenciarelli, Daniele Gorla, Emilio Tuosto
WWW
2008
ACM
14 years 9 months ago
Extending the compatibility notion for abstract WS-BPEL processes
WS-BPEL Processes Dieter K?nig IBM B?blingen Laboratory Sch?naicher Stra?e 220, 71032 B?blingen, Germany dieterkoenig@de.ibm.com Niels Lohmann Universit?t Rostock, Institut f?r Inf...
Dieter König, Niels Lohmann, Simon Moser, Chr...