In today's security protocols (also called “security ceremonies” when humans play a key role), different nodes may have capabilities: computers can encrypt and decrypt messages, whereas cannot; biometric device capture information, random number generator used in e-banking so on. Furthermore, even if node has the decryption capability, it must also know encryption to message. Actor-network proc...

BACKGROUND Low-fluence (low irradiation energy density) pulsed-dye lasers (PDLs) have been used for atrophic acne scarring, and anecdotal experience suggests that long-term improvements in inflammatory acne can be seen after one PDL treatment. Our aim was to compare the efficacy and tolerability of such PDL treatment with sham treatment in patients with facial inflammatory acne in a double-blin...

INTRODUCTION The aim of this study was to compare the biological interaction of human osteoblasts and cells of the human periodontal ligament (PDL) with different endodontic restorative material as Mineral Trioxide Aggregate (MTA), Biodentine, amalgam and composite over a time period of 20 days. MATERIALS AND METHODS Human PDL cells and osteoblasts were harvested, cultured and according to st...

The Process Description Language (PDL) [2] was developed as a Java extension for description of processes. It describes process as a set of activities that are partially ordered (in time) using a mechanism based on high level Petri Nets especially ICNets[1]. The aim of this paper is to give precise and formal definition of the PDL language semantics. For this purpose the theory of Abstract Stat...

Over the last 25 years, a lot of work has been done on seeking for decidable nonregular extensions of Propositional Dynamic Logic (PDL). Only recently, an expressive extension of PDL, allowing visibly pushdown automata (VPAs) as a formalism to describe programs, was introduced and proven to have a satisfiability problem complete for deterministic double exponential time. Lately, the VPA formali...

Extensions of propositional dynamic logic (PDL) with nonregular programs are considered. Three classes of nonregular languages are defined, and for each of them it is shown that for any language L in the class, PDL, with L added to the set of regular programs as a new program, is decidable. The first class consists of the languages accepted by pushdown automata that act only on the basis of the...

This paper introduces a new method for gathering unstructured workflow definition data in order to model it in relational databases. In addition to introducing an open database model, a solution has been developed to facilitate the process of defining the workflow data for process designers. This solution consists of the Process Definition Language (PDL), pre-processing of unstructured workflow...