Searching for authors named "Jeremy Bryans" – sorted by Relevance.
-
Implementing A Modal Logic Over Data And Processes Using XTL
- The modal logic FULL is designed to capture strong bisimulation over early symbolic transition systems (STSs) for full LOTOS. It provides a compact way of expressing and verifying properties involving both data and transitions. In this paper we present a restricted prototype implementation of a mode
- Cited by 5 (1 self) – Add To MetaCart
-
CSP, PVS and a Recursive Authentication Protocol
- this paper we consider the nature of machine proofs used in the CSP approach to the verification of authentication protocols. In [Sch96], a general method is presented for the analysis and verification of authentication protocols using the process algebra CSP [Hoa85]. The CSP syntax provides a natur
- Cited by 3 (1 self) – Add To MetaCart
-
Reasoning about XACML policies using CSP
- In this work we explore the use of process algebra in formalising and analysing access control policies. We do this by considering a standard access control language (XACML) and show how the core concepts in the language can be represented in CSP. We then show how properties of these policies may al
- Cited by 5 (0 self) – Add To MetaCart
-
Stochastic Specification and Verification
- Modern distributed systems include a class of applications in which non-functional requirements are important.
- Cited by 3 (0 self) – Add To MetaCart
-
unknown title
- This is the online version of the proceedings for the “E-voting and e-Government Workshop in the UK”. Authors who submitted papers to the workshop were entitled to retain copyright if they wished to have the paper published elsewhere. As such some papers have been restricted to a short abstract in t
- Add To MetaCart
-
A failures semantics for ET-LOTOS
- A denotational semantics is presented for ET-LOTOS [LeL94] in the style of semantics for timed CSP, in terms of timed failures with additional information about internal events. This semantics is consistent with the original operational semantics, and is shown to be the weakest congruence stronger t
- Add To MetaCart
-
Model checking stochastic automata
- Modern distributed systems include a class of applications in which non-functional requirements are important. In particular, these applications include multimedia facilities where real time constraints are crucial to their correct functioning. In order to specify such systems it is necessary to des
- Cited by 6 (2 self) – Add To MetaCart
-
A Model Checking Algorithm for Stochastic Systems
- this report we present an algorithm for model-checking stochastic automata with respect to a probabilistic temporal logic. We consider the stochastic automata presented in [D'A99]. In particular, the algorithm is novel in that it allows any (continuous) probability density functions to be used in th
- Cited by 2 (1 self) – Add To MetaCart
-
Real-time LOTOS and timed observations
- This paper presents a new semantic model for real-time LOTOS, based upon a notion of timed observations. The novelty of the model is explained, as is its value. It di#ers from the usual operational models in that it permits an abstract, property-oriented view of processes. It di#ers from earlier den
- Cited by 2 (0 self) – Add To MetaCart
-
Towards a denotational semantics for ET-LOTOS
- The formal specification language LOTOS is an international standard for use in Open Systems Interconnection. A timed extension called ET-LOTOS has been proposed. This paper presents a fully-abstract denotational semantics for the process algebraic component of this extension. The benefits of a deno
- Cited by 3 (1 self) – Add To MetaCart

