The researches have shown that not all the Petri Net machines can be used to describe attack behavior. When Petri Net machines adapted for attack behavior modeling are detecting the network, for some event of current status, if there is matching event in the model, it has only one corresponding transition; otherwise that may cause errors. Since sharing synthesis and synchronization synthesis of...

We propose a variant mix-net method, which we call a “marked mix-net” . Marked mix-nets avoid the extra cost associated with verifiability (producing a proof of correct mixing operation), while offering additional assurances about the privacy of the messages, compared to a non-verifiable mix-net. With a marked mix-net, each mix-server adds an extra secret mark in each ciphertext, and the input ...

Concurrent calculi, such as CCS, are defined in terms of labelled transition system; similarly, here we introduce the notion of net (or distributed) calculus, which is defined through a place/transition Petri net. As a first case study, a simple calculus of nets, called SCONE, is proposed. Relationships between SCONE and the subset of CCS without restriction and relabelling, called RCCS, are st...

The dynamic modelling of logical systems widely calls upon the explicit use of time and the event notion. In terms of Function Chart Grafcet or Interpreted Petri Nets for instance, events are generally represented by " rising or falling edges " of logical variables. However, numerous ambiguities are encountered in the models because the translation of events into edges is not formal enough. In ...

We develop a theory for net components with labeled interface places and transitions. Nets are shown to be isomorphic to algebraic terms, with marked places and transitions as atoms and arc addition, fusion and relabeling as operators. Net terms with the step firing rule are given a Plotkin-style SOS semantics, yielding compositionality of the operators. Some rules for reducing nets modulo stro...

We define an epistemic logic for labelled transition systems by introducing equivalence relations for the agents on the states of the labelled transition system. The idea is that agents observe the dynamics of the system modulo their ability to distinguish states and in the process learn about the current state and past history of the execution. This is in the spirit of dynamic epistemic logic ...

The following conjecture due to Y. Edel is affirmatively solved: two quadratic APN (almost perfect nonlinear) functions are CCZ-equivalent if and only if they are extended affine equivalent.