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
Discrete time process algebra
1996
Formal Aspects of Computing
Preserved Fulltext
({r) Discrete time process algebra ...
At each step we will motivate our choice and compare it with the sources of discrete time This paper intends to present discrete time process algebra in a clear connection with real time process algebra ...
Discrete event systems: Dynamic versus static topology. A new efficient implementation of CSP with output guards. AlgebraiC specification and implementation of infinite processes. ...
doi:10.1007/bf01214556
fatcat:755qs2qdqzg2rpd7komlyn7lua
Discrete time process algebra with abstraction
[chapter]
1995
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 2019; you can also visit the original URL.
The file type is application/pdf.
The axiom system ACP of [BEK84a] was extended to discrete time in [BAB95] . ...
We present versions based on relative timing and on absolute timing. Both approaches are integrated using parametric timing. The time free ACP theory is embedded in the discrete time theory. ...
DISCRETE TIME PROCESS ALGEBRA WITH RELATIVE TIMING. We start out from the relative discrete time process algebra of [BAB95] . ...
doi:10.1007/3-540-60249-6_38
fatcat:d4y7e2romrabdnpi6y32ofjplm
Process Algebra with Timing: Real Time and Discrete Time
[chapter]
2001
Handbook of Process Algebra
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.
In this section, we give the signature, axioms and term model of ACP,at, a standard real time process algebra with absolute timing. ...
The discrete time versions are conservative extensions of the discrete time versions of ACP being known as ACP dot and ACP d,t. ...
D
Discrete time process algebra In this section, we present Acpda' and ACpdrt, discrete time process algebras with absolute timing and relative timing, respectively. ...
doi:10.1016/b978-044482830-9/50028-x
fatcat:cexairwbr5gphnf6yrgzfkuw6q
Discrete Time Process Algebra and the Semantics of SDL
[chapter]
2001
Handbook of Process Algebra
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 2014; you can also visit the original URL.
The file type is application/pdf.
We present an extension of discrete time process algebra with relative timing where recursion, propositional signals and conditions, a counting process creation operator, and the state operator are combined ...
We also propose a semantics for a simplified version of SDL, using this extension of discrete time process algebra to describe the meaning of the language constructs. ...
Discrete relative time process algebra In this subsection, we present discrete relative time process algebra without immediate deadlock and delayable actions. ...
doi:10.1016/b978-044482830-9/50036-9
fatcat:ziek6qotvvhkxbcmltseapn5o4
The I2C-bus in discrete-time process algebra
1997
Science of Computer Programming
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 2008; you can also visit the original URL.
The file type is application/pdf.
Using discrete time process algebra with relative timing, a model for the I 2 C-bus is designed. ...
First, a single master without timing constraints is considered. Then the model is adapted to deal with the timing constraints. Then also the restriction to a single master is relaxed. ...
Discrete Time Process Algebra with Relative Timing In this section, we will introduce the process algebra used for modelling the I 2 C-bus in this paper. ...
doi:10.1016/s0167-6423(96)00036-6
fatcat:z5ufexxhwnhjbkrti5angdqcmi
Achieving Discrete Relative Timing with Untimed Process Algebra
2007
12th IEEE International Conference on Engineering Complex Computer Systems (ICECCS 2007)
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.
In the past, many timed process algebras have been developed, using untimed process algebras as initial inspiration. ...
In this paper, we take another approach, considering the possibility to model timing aspects with an untimed process algebra. ...
We composed the tables by examining the rules of BPA drt -ID and ACP drt [2] , which are the Basic Process Algebra extended with discrete relative timing by means of a delay operator, and the Algebra ...
doi:10.1109/iceccs.2007.13
dblp:conf/iceccs/Wijs07
fatcat:kkjmjkp4qnha7fxst6fepi4to4
On a Stochastic Difference Equation for the Multi-Dimensional Weakly Stationary Process with Discrete Time
[chapter]
1988
Algebraic Analysis
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.
In §2, we will introduce a forward Crespo backward) innovation process 1+ = CI+Cn);nEN)Cresp. I =CI Cn);nEN» associated with X 1 tis noted that I+(resp. 1_) is an orthogonal process. ...
the result obtained in the continuous-time case, which are called the first and second KMO-Langevin equation, related to the case of long time prediction interval. ...
doi:10.1016/b978-0-12-400466-5.50016-0
fatcat:gamfsrsexjb6th6qcavwnilnry
Discrete real-time and stochastic-time process algebra for performance analysis of distributed systems
2008
2008 8th International Conference on Application of Concurrency to System Design
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 present a process algebra with conditionally distributed discrete-time delays and generally-distributed stochastic delays. ...
We compare performance analysis using timed probabilistic reward graphs and discrete-event simulation. * This research has been funded by the Dutch BSIK/BRICKS project AFM 3.2. ...
An axiomatization for a process algebra that embeds real-time delays with socalled context sensitive interpolation into a restricted form of discrete stochastic time is given in [18] . ...
doi:10.1109/acsd.2008.4574610
dblp:conf/acsd/MarkovskiV08
fatcat:54em2rwmuzewbgz3gixoaoqeya
An extension problem for discrete-time almost periodically correlated stochastic processes
2000
Linear Algebra and its 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 2019; you can also visit the original URL.
The file type is application/pdf.
Time Ser. Anal., 2000, to appear) an extension problem for covariance matrix of discrete-time periodically correlated stochastic processes introduced by Gladyshev was treated. ...
In this paper we study the same problem for discretetime almost periodically correlated stochastic processes. ...
In this paper we solve a problem of the same kind for discrete-time almost periodically correlated stochastic processes.
Problem 1.2. ...
doi:10.1016/s0024-3795(00)00043-4
fatcat:r4b5xy2w7zbt3h3ttye6gl4twq
Lie algebraic stability analysis for switched systems with continuous-time and discrete-time subsystems
2006
IEEE transactions on circuits and systems - 2, Analog and digital signal processing
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 2010; you can also visit the original URL.
The file type is application/pdf.
We analyze stability for switched systems which are composed of both continuous-time and discrete-time subsystems. ...
under a dwell time scheme. ...
In this paper, we aim to apply the Lie algebraic approach, proposed in Agrachev and Liberzon, 2001) , to switched systems which are composed of both continuous-time and discrete-time subsystems, where ...
doi:10.1109/tcsii.2005.856033
fatcat:ngrk7voam5f77c76kmrd2s6ywu
Process languages with discrete relative time based on the Ordered SOS format and rooted eager bisimulation
2004
The Journal of Logic and Algebraic Programming
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.
discrete relative time. ...
The obtained timed process languages preserve a timed version of rooted eager bisimulation preorder and the time determinacy property. ...
Acknowledgements We would like to thank Iain Phillips, Matthew Hennessy and Rance Cleaveland for discussions concerning process languages with time. ...
doi:10.1016/j.jlap.2004.03.002
fatcat:c32m4l4dhfcehmgfkxw6w6j4xi
Discrete-time process algebra
[article]
1997
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.
Discrete Timed CSP (Jeffrey) In JEFFREY [109] we find a timed process algebra that uses a discrete time domain. ...
In Chapter 3 we give an introduction into discrete-time process algebra with relative timing and introduce some process algebras that are discrete-time extensions of BPA. ...
. . . . . . . . . . . . . . . . . . . . . . . . . . 38 for discrete-time process algebra 65, 172, 211 for untimed process algebra . . . . . 38 empty process axiom nomenclature for . . . . . . . . ...
doi:10.6100/ir498558
fatcat:uruzk5dyvjfnzgt552yd4ezdd4
Discrete time process algebra
[chapter]
CONCUR '92
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.
We present versions based on relative timing and on absolute timing. Both approaches are integrated using parametric timing. The time free ACP theory is embedded in the discrete time theory. ...
The axiom system ACP of [BEK84aJ was extended with real time features in [BAB91 J. Here we proceed to define a discrete time extension of ACP, along the lines of ATP [NIS94J. ...
We propose to use the phrase discrete time process algebra if an enumeration of time slices is used. The objective of this paper is to extend ACP to a discrete time process algebra. ...
doi:10.1007/bfb0084806
dblp:conf/concur/BaetenB92
fatcat:g3kfnqgoljg73lekxoqc5ismoy
Information flow analysis in a discrete-time process algebra
Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13
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.
This is done by enhancing the Security Process Algebra of [6, 10] with some extra constructs to model real-time systems (in a discrete time setting); and then by studying the natural extensions of those ...
But, when the specification is refined with time, some interesting information flows are detected. ...
Conclusions and future research We have shown the flexibility of the theory of [5, 6, 18] by extending it to a discrete time process algebra. ...
doi:10.1109/csfw.2000.856935
dblp:conf/csfw/FocardiGM00
fatcat:ye72rob4bzhino7o7x2562lz3m
An algebraic approach to discrete short-time Fourier transform analysis and synthesis
ICASSP '84. IEEE International Conference on Acoustics, Speech, and Signal Processing
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 2004; you can also visit the original URL.
The file type is application/pdf.
An algebraic representation of the discrete shorttime Fourier transform (DSTFT) is presented for the case in which the analysis window length N equals the transform block size N. ...
This representation allows the apphcation of algebraic tools for determining an optimal synthesis system which minimizes the mean square error between a given modified DSTFT (which is not necessarily a ...
to be a unity system for any given value of the time update step-size R, ReM, of the sliding analysis window. ...
doi:10.1109/icassp.1984.1172422
dblp:conf/icassp/ShpiroM84
fatcat:fy44yblograufiggw2z73qylge
« Previous
Showing results 1 — 15 out of 257,439 results