Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Deterministic behavioural models for concurrency

    This paper offers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models are all proved equivalent in the rathe...

    Vladimiro Sassone, Mogens Nielsen in Mathematical Foundations of Computer Scien… (1993)

  2. No Access

    Chapter and Conference Paper

    On the semantics of Petri Nets

    Petri Place/Transition (PT) nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the “token game” is too intensional, eve...

    José Meseguer, Ugo Montanari, Vladimiro Sassone in CONCUR '92 (1992)