Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Mousavi Mohammad Reza 1978 ) srt2:(2005-2009)"

Sökning: WFRF:(Mousavi Mohammad Reza 1978 ) > (2005-2009)

  • Resultat 1-3 av 3
Sortera/gruppera träfflistan
  • Aceto, Luca, et al. (författare)
  • A Rule Format for Unit Elements
  • 2009
  • Ingår i: The Equational Logic of Parallel Processes. - Eindhoven : Eindhoven University of Technology.
  • Rapport (övrigt vetenskapligt)abstract
    • This paper offers a meta-theorem for languages with a Structural Operational Semantics (SOS) in the style of Plotkin. Namely, it proposes a generic rule format for SOS guaranteeing that certain constants act as left- or right-unit elements for a set of binary operators. We show the generality of our format by applying it to a wide range of operators from the literature on process calculi.
  • Dechesne, Francien, et al. (författare)
  • Operational and Epistemic Approaches to Protocol Analysis : Bridging the Gap
  • 2007
  • Rapport (övrigt vetenskapligt)abstract
    • Operational models of (security) protocols, on one hand, are readable and conveniently match their implementation (at a certain abstraction level). Epistemic models, on the other hand, are appropriate for specifying knowledge-related properties such as anonymity or secrecy. These two approaches to specification and verification have so far developed in parallel and one has either to define ad hoc correctness criteria for the operational model or use complicated epistemic models to specify the operational behavior. We work towards bridging this gap by proposing a combined framework which allows for modeling the behavior of a protocol in a process language with an operational semantics and supports reasoning about properties expressed in a rich logic which combines temporal and epistemic operators.
  • Mousavi, Mohammad Reza, 1978-, et al. (författare)
  • Semantics and expressiveness of ordered SOS
  • 2007
  • Rapport (övrigt vetenskapligt)abstract
    • Structured Operational Semantics (SOS) is a popular method for defining semantics by means of transition rules. An important feature of SOS rules is negative premises, which are crucial in the definitions of such phenomena as priority mechanisms and time-outs. However, the inclusion of negative premises in SOS rules also introduces doubts as to the preferred meaning of SOS specifications. Orderings on SOS rules were proposed by Phillips and Ulidowski as an alternative to negative premises. Apart from the definition of the semantics of positive GSOS rules with orderings, the meaning of more general types of SOS rules with orderings has not been studied hitherto. This paper presents several candidates for the meaning of general SOS rules with orderings and discusses their conformance to our intuition for such rules. We take two general frameworks (rule formats) for SOS with negative premises and SOS with orderings, and present semantics-preserving translations between them with respect to our preferred notion of semantics. Thanks to our semantics-preserving translation, we take existing congruence meta-results for strong bisimilarity from the setting of SOS with negative premises into the setting of SOS with orderings. We further compare the expressiveness of rule formats for SOS with orderings and SOS with negative premises. The paper contains also many examples that illustrate the benefits of SOS with orderings and the properties of the presented definitions of meaning.
Skapa referenser, mejla, bekava och länka
  • Resultat 1-3 av 3
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy