Sciweavers

19 search results - page 3 / 4
» Properties of Distributed Timed-Arc Petri Nets
Sort
View
CONCUR
2004
Springer
15 years 5 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
Paolo Baldan, Andrea Corradini, Barbara König
WOSP
2004
ACM
15 years 5 months ago
Software performance modelling using PEPA nets
Modelling and analysing distributed and mobile software systems is a challenging task. PEPA nets—coloured stochastic Petri nets—are a recently introduced modelling formalism w...
Stephen Gilmore, Jane Hillston, Leïla Kloul, ...
103
Voted
IASTEDSEA
2004
15 years 1 months ago
Modeling and analyzing security protocols in SAM: A case study
: Secure distributed systems rely on secure information flow between different hosts, thus placing a heavy requirement on the underlying security protocols. In this paper, we use S...
Zhengfan Dai, Xudong He, Junhua Ding, Shu Gao
SACMAT
2003
ACM
15 years 4 months ago
Cooperative role-based administration
In large organizations the administration of access privileges (such as the assignment of an access right to a user in a particular role) is handled cooperatively through distribu...
Horst Wedde, Mario Lischka
95
Voted
DEDS
2007
104views more  DEDS 2007»
14 years 11 months ago
Trellis Processes : A Compact Representation for Runs of Concurrent Systems
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offlin...
Eric Fabre