Sciweavers

1992 search results - page 11 / 399
» Model Based Testing with Labelled Transition Systems
Sort
View
JSW
2008
110views more  JSW 2008»
13 years 7 months ago
An Open Approach for the Applied Pi Calculus
A notion of open bisimulation is proposed for the Applied Pi Calculus, which extends -calculus in order to facilitate analyzing security protocols. Our notion is based on the label...
Han Zhu, Yonggen Gu, Xiaohong Wu
SEKE
2005
Springer
14 years 25 days ago
Design an Interoperable Mobile Agent System Based on Predicate Transition Net Models
Mobile agents provide an effective and flexible style to develop advanced distributed systems. In order to promote interoperability and ensure the quality of mobile agent systems,...
Junhua Ding, Dianxiang Xu, Yi Deng, Peter J. Clark...
SAJ
2000
101views more  SAJ 2000»
13 years 7 months ago
Algebraic results for structured operational semantics
This paper presents algebraic results that are important for the extended tyft/tyxt format [12, 13] which can be used to describe many different process algebras. This format is b...
Vashti C. Galpin
IFIP
2005
Springer
14 years 26 days ago
Opacity Generalised to Transition Systems
Recently, opacity has proved to be a promising technique for describing security properties. Much of the work has been couched in terms of Petri nets. Here, we extend the notion of...
Jeremy Bryans, Maciej Koutny, Laurent Mazaré...
ICST
2009
IEEE
14 years 2 months ago
Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM)
The problem of testing from an extended finite state machine (EFSM) can be expressed in terms of finding suitable paths through the EFSM and then deriving test data to follow the ...
Abdul Salam Kalaji, Robert M. Hierons, Stephen Swi...