Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 13 of 13 for “"process algebra"”.
-
Process algebra approach to parallel DBMS performance modelling
Abstract unavailable please refer to PDF
-
Contributions to the theory of syntax with bindings and to process algebra
… a general technique for proving bisimilarity in process algebra. Our technique, presented as a formal proof system, is applicable to a wide range of process algebras. The proof system is incremental, in that it allows building incrementally an a priori unknown bisimulation, and pattern-based, in …
-
On the use of process algebra techniques in computational modelling of cancer initiation and development
… be tested experimentally. This thesis evaluates process algebra techniques as description formalisms for a collection of cancer-related models. Process algebras view biology as a dynamic interactive communication network, in which an individual agent is performing a computation corresponding to …
-
Optimal planning with temporal logic specifications
… Problem (VRP), in which temporal logics and process algebra are utilized to represent a large class of mission specifications in a systematic way. The thesis is structured in two parts. In the first part, two temporal logics that are remarkably close to the natural language, namely the linear …
-
A Tool for prototyping concurrent design specifications
Process algebra is one formalism which aids in the design and verification of complex concurrent systems by using algebraic expressions to describe the architectural and behavioral aspects. We introduce ACS (Algebra of Communicating Systems), a process algebraic specification language which …
-
Formalizing languages for service oriented computing
… perspective. In this work we present SOCK, a process algebra based language inspired by the Web Service orchestration language WS-BPEL which catches the essentials of Service Oriented Computing. From the definition of SOCK we will able to define a general model for dealing with Service …
-
Extending the language and applications of Maude-NPA through rewriting semantics
… hierarchy of FVP theories for approximating the algebraic property of homomorphic encryption over an Abelian group, which enables analysis of protocols having homomorphic encryption over abelian group in Maude-NPA; (ii) it extends the strand space model with support for choice, and develops a …
-
A formal methodology for the verification of concurrent systems
… to a suitably secure specification. However, the process of verification is often made more complex by the concurrency and real-time considerations which are inherent in many applications. A response to this is the use of formal methods for the specification and verification of safety critical …
-
The automated translation of integrated formal specifications into concurrent programs
… language [Abr96] with the event-based process algebra CSP [Hoa78]. The JCSP package [WM00b] presents a concurrent Java implementation for CSP/occam.<br/>In this thesis, we present a developing strategy for implementing such a combined specificationas a concurrent Java program. The …
-
Symbolic planning for heterogeneous robots through composition of their motion description languages
… composition system are analyzed and an automatic process to generate sequential atom plan is introduced. The novelty of the formalism is in producing a composed system with a behavior that could be a superset of the union of the behaviors of its generators. As robotic systems perform increasingly …
-
Generalized Synchronization Trees
… Trees (STs) to model interconnected computing processes, and GSTs afford a means of applying those same perspectives to CPSs. In particular, STs -- and thus GSTs -- provide a very natural setting for studying bisimulation and composition. In this thesis, we study both matters from a number of …
-
Symbolic semantics for CSP
Communicating Sequential Processes (CSP) is a well-known formal language for describing concurrent systems, for which a transition semantics has been given by Brookes, Hoare and Roscoe. In this thesis, we present a generalized transition semantics of CSP, which we call HCSP, that merges the …
-
Calculus for decision systems
… of the system interact. This framework is a process algebra called Calculus for Decision Systems (CDS). This calculus provides means to create mathematical expressions that capture how the systems interact and react to different stimuli. It also provides the ability to formulate procedures to …