A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Process Algebra in PVS
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
The aim of this work is to investigate mechanical support for process algebra, both for concrete applications and theoretical properties. ...
Two approaches are presented using the verification system PVS. One approach declares process terms as an uninterpreted type and specifies equality on terms by axioms. ...
Concluding remarks can be found in Section 5.
Modeling Process Algebra in PVS We discuss two approaches to defining process algebra in PVS. ...
doi:10.1007/3-540-49059-0_19
fatcat:pechb46pjzhutl3idkym2bco4i
A Multi-agent System for Cross-Organizational Workflows Management Based on Process-View
[chapter]
2007
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Within this multi-agent system, a Petri net algebra model and a character string mapping algorithm are proposed to automate the mapping from a Petri net workflow model to a process-view workflow model; ...
Process-view provides a promising way to crossorganizational workflows design. ...
(d); (5) Process L` by character string mapping algorithm, the PN algebra model L`` of the PV workflow model can be obtained described in Fig. 2. ...
doi:10.1007/978-3-540-72588-6_37
fatcat:edwm6ix4hbhztoumbbbvzfrrce
Mixed formal specifications with PVS
2002
Proceedings 16th International Parallel and Distributed Processing Symposium
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
GAT is a mixed formalism based on Symbolic Transition Systems (STSs) and algebraic specifications of partial abstract data types. This paper presents how to translate a GAT into PVS. ...
Formal specification of mixed systems is one of the main issues in software engineering. However several difficulties remain. ...
As in process algebra, we distinguish two kinds of GAT components: sequential components and concurrent components. ...
doi:10.1109/ipdps.2002.1016615
dblp:conf/ipps/AllemandR02
fatcat:hrq4nsai55cgdfb7k6rljziizq
Design, Operation, Control, and Economics of a Photovoltaic/Fuel Cell/Battery Hybrid Renewable Energy System for Automotive Applications
2015
Processes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
bus lifetime) in Newark, DE, OPEN ACCESS Processes 2015, 3 453 establishing the economic viability of the proposed addition of a PV array to the existing University of Delaware fuel cell/battery bus. ...
operating objectives-meeting the total power demand of the bus and maintaining the desired state of charge (SOC) of the NiCd battery-are achieved with appropriately designed controllers: a logic-based "algebraic ...
Acknowledgments We are grateful to Doug Brunner for assistance in acquiring data from the fuel cell/battery bus currently operating at the University of Delaware, and to Jingliang Zhang for his assistance ...
doi:10.3390/pr3020452
fatcat:zvmw7ldgqfht5pfi7jtyestteq
PVS Embedding of cCSP Semantic Models and Their Relationship
2009
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The cCSP process algebra terms are defined in PVS by using mutually recursive datatype. The trace and the operational semantics of the algebra are embedded in PVS. ...
This paper demonstrates an embedding of the semantic models of the cCSP process algebra in the general purpose theorem prover PVS. cCSP is a language designed to model long-running business transactions ...
We have embedded the semantic models in PVS by using its existing logics and theories. ...
doi:10.1016/j.entcs.2009.08.020
fatcat:l6klx2exevgzhdf6ulsgyhsgjm
Page 251 of Journal of the Washington Academy of Sciences Vol. 39, Issue 8
[page]
1949
Journal of the Washington Academy of Sciences
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
q is the algebraic net amount of heat energy, w is the algebraic net amount of “PV” work energy, and u is the algebraic net amount of all other kinds of energy, pass- ing into the system. ...
That is to say, whenever any process occurs, the sum of all the changes in energy, taken over all the systems par- ticipating in the process, is zero:
SdE =O. (6)
In equation 6, E represents the energy ...
Hidden verification for computational mathematics
2005
Journal of symbolic computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We have implemented in PVS a library of facts about elementary and transcendental functions, and automatic procedures to attempt proofs of continuity, convergence and differentiability for functions in ...
Hence we are able to support the analysis of differential equations in Maple by direct calls to PVS for: result refinement and verification, discharge of verification conditions, harnesses to ensure more ...
We thank Mike Dewar of NAG Ltd for his interest and suggestions, James Davenport, Manuel Bronstein for advice on computer algebra, and the members of the PVS mailing list for many swift answers. ...
doi:10.1016/j.jsc.2004.12.005
fatcat:lqoooacsufcvnbx5jgsdkk35ke
Complete Models of Transmission-connected Photovoltaic Plant Using Modularity Principle for Power System Small Signal Stability Study
2017
IEEJ Journal of Industry Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Finally, applications of the provided models in the power system small signal stability study are presented, where the characteristics of the PV plant can be closely simulated. ...
An overall structure using the modularity principle to model the PV plant is provided. Then each module is described, which is followed by the algorithm that how all modules work in conjunction. ...
As for the PV power generation process, there are two possible circuits, namely the one-stage PV plant and the two-stage PV plant shown in Fig. 1 . ...
doi:10.1541/ieejjia.6.435
fatcat:q34kgs7hb5d5xj4fqg7efoabve
Formalizing cCSP Synchronous Semantics in PVS
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We show how to embed process algebra terms and semantics into PVS and to use these embeddings to prove the semantic relationship. ...
Synchronization was missing from the earlier semantic definitions which is an important feature for any process algebra. ...
In that respect, a closely related research on the tool support for a process algebra shown in [23] , where a CSP-like algebra, called DI-Algebra [24] is formalized in HOL. ...
arXiv:1001.3464v1
fatcat:cjhsk53vujak5gefslx3ap5uh4
Lifted Relational Algebra with Recursion and Connections to Modal Logic
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We observe the presence of information propagation in several formalisms for efficient reasoning and use it to express unary negation and operations used in graph databases. ...
The essence of our proposal is to lift Codd's relational algebra from operations on relational tables to operations on classes of structures (with recursion), and to add a direction of information propagation ...
Suppose we are given, on the input, a formula φ in the "flat" algebra, pV, vq, A andĒ. ...
arXiv:1612.09251v1
fatcat:ulstwcfr35c3nlqinxykjptnii
Algebraic Structures on Typed Decorated Rooted Trees
2021
Symmetry, Integrability and Geometry: Methods and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We also define families of morphisms and in particular we prove that any Connes-Kreimer Hopf algebra of typed and decorated trees is isomorphic to a Connes-Kreimer Hopf algebra of non-typed and decorated ...
generalizing Grossman and Larson's construction), commutative and noncocommutative Hopf algebras (generalizing Connes and Kreimer's construction), bialgebras in cointeraction (generalizing Calaque, Ebrahimi-Fard ...
Note that the tree ¤ ¤ ¤ T paq 0 pt 0 q λ T I¨ pt 1 q v 1 T paq 1¨¤ ¤ ¤¨ pt paq na q vn a T na , which is shortly denoted by T pvq λ T I , is obtained in the following process: 1. ...
doi:10.3842/sigma.2021.086
fatcat:g3h7napbk5dbpnif5utrmxebma
Algebraic structures on typed decorated rooted trees
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Grossman and Larson's construction),commutative and noncocommutative Hopf algebras (generalizing Connes and Kreimer's construction),bialgebras in cointeraction (generalizing Calaque, Ebrahimi-Fard and ...
We also define families of morphisms and in particular we prove that any Connes-Kreimer Hopf algebraof typed and decorated trees is isomorphic to a Connes-Kreimer Hopf algebra of non--typed and decoratedtrees ...
.¯‚ pt paq na q vn a T na , which is shortly denote by T ‚ pvq λ T 1 , is obtained in the following process: 1. Delete the branches T paq 1 , . . . , T paq na coming from a in T . ...
arXiv:1811.07572v2
fatcat:uug77gmjgvd2xiffk64xcgxzsa
Preface to the proceedings of FMIS 2013
2015
Electronic Communications of the EASST
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
They use Markovian process algebra PEPA (Probabilistic Evaluation Process Algebra) to describe the overall system model. ...
from using PVS. ...
doi:10.14279/tuj.eceasst.69.966.986
dblp:journals/eceasst/BowenR13
fatcat:46jdo67ngbhiplufvyznozhaeu
The Boolean Algebra of Cubical Areas as a Tensor Product in the Category of Semilattices with Zero
2014
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this paper we describe a model of concurrency together with an algebraic structure reflecting the parallel composition. ...
The collection of all these cubical areas enjoys a structure of tensor product in the category of semi-lattice with zero. ...
The points of these subsets are to be considered as the states of the PV program. Holes in these subsets arise from synchronizations between processes. ...
doi:10.4204/eptcs.166.7
fatcat:gr3e7oyuebdh7om3gelulleilq
How to write a coequation
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We present each of these in a tutorial fashion, relate them to each other, and discuss their respective uses. ...
In this review paper, we argue that this is partly due to the multitude of syntaxes for writing down coequations, which seems to have led to some confusion about what coequations are and what they are ...
Studying behavioural equivalences like these is a popular topic in process algebra [78] . ...
arXiv:2109.11967v1
fatcat:gjiohhvtfvhrhnbgwzpqiatvoa
« Previous
Showing results 1 — 15 out of 19,824 results