ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Unknown
    Handbook of network and system administration (2007)
    London : Elsevier
    Details
    Keywords: DDC 004.6068 ; LC TK5105.5 ; Computer networks - Management
    Pages: Online-Ressource (x, 1016 pages)
    ISBN: 9780444521989
    URL: http://www.sciencedirect.com/science/book/9780444521989
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    E-BOOK
  • 2
    Electronic Resource
    Electronic Resource
    Real time process algebra (1991)
    Springer
    Formal aspects of computing 3 (1991), S. 142-188 
    Details
    ISSN: 1433-299X
    Keywords: Real time ; Process algebra ; ACP
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We describe an axiom system ACP p that incorporates real timed actions. Many examples are provided in order to explain the intuitive contents of the notation. ACP p is a generalisation of ACP. This implies that some of the axioms have to be relaxed and that ACP can be recovered as a special case from it. The purpose of ACP p is to serve as a specification language for real time systems. The axioms of ACP p explain its operational meaning in an algebraic form.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01898401
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Real space process algebra (1993)
    Springer
    Formal aspects of computing 5 (1993), S. 481-529 
    Details
    ISSN: 1433-299X
    Keywords: Process algebra ; Real time process algebra ; Real space process algebra ; Asynchronous communication ; Broadcasting ; State operator ; Priorities
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The real time process algebra of Baeten and Bergstra [Formal Aspects of Computing,3, 142–188 (1991)] is extended to real space by requiring the presence of spatial coordinates for each atomic action, in addition to the required temporal attribute. It is found that asynchronous communication cannot easily be avoided. Based on the state operators of Baeten and Bergstra [Information and Computation,78, 205–245 (1988)] and following Bergstra et al. [Proc. Seminar on Concurrency, LNCS 197, Springer, 1985, pp. 76–95], asychronous communication mechanisms are introduced as an additional feature of real space process algebra. The overall emphasis is on the introductory explanation of the features of real space process algebra, and characteristic examples are given for each of these.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01211247
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    On sequential composition, action prefixes and process prefix (1994)
    Springer
    Formal aspects of computing 6 (1994), S. 250-268 
    Details
    ISSN: 1433-299X
    Keywords: Process algebra ; Process calculus ; Sequential composition ; Action prefix ; Process prefix ; CCS ; ACP
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We illustrate the difference between sequential composition in process algebra axiomatisations like ACP and action prefixing in process calculi like CCS. We define both early and late input in a general framework extending ACP, and consider various subalgebras, some very close to value passing CCS, another one close to CSP.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01215407
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Discrete time process algebra (1996)
    Springer
    Formal aspects of computing 8 (1996), S. 188-208 
    Details
    ISSN: 1433-299X
    Keywords: Process algebra ; Timing ; Discrete time ; ACP
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The axiom system ACP of [BeK84a] was extended with real time features in [BaB91]. Here we proceed to define a discrete time extension of ACP, along the lines of ATP [NiS94]. 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.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01214556
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Program Algebra for Component Code (2000)
    Springer
    Formal aspects of computing 12 (2000), S. 1-17 
    Details
    ISSN: 1433-299X
    Keywords: Keywords: Program; Instructions; Repetition; Behaviour extraction; Projection semantics; Embedding; Canonical form
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract. The jump instruction is considered essential for an adequate theoretical understanding of imperative sequential programming. Using atomic actions and tests as a basis we outline an algebra of programs, denoted PGA, which captures the crux of sequential programming. PGA provides an ontology for programs rather than a semantics. Out of a multitude of conceivable semantic views on PGA we single out a behaviour extraction operator which assigns to each program a behaviour. The meaning of the constants of PGA is explained in terms of the extracted behaviour. Using PGA a small hierarchy of program notations is developed. Projection semantics is proposed as a tool for the description of program semantics.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/PL00003928
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    The axiomatic semantics of programs based on Hoare's logic (1984)
    Springer
    Acta informatica 21 (1984), S. 293-320 
    Details
    ISSN: 1432-0525
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary This paper is about the Floyd-Hoare Principle which says that the semantics of a programming language can be formally specified by axioms and rules of inference for proving the correctness of programs written in the language. We study the simple language WP of while-programs and Hoare's system for partial correctness and we calculate the relational semantics of WP as this is determined by Hoare's logic. This calculation is possible by using relational semantics to build a completeness theorem for the logic. The resulting semantics AX we call the axiomatic relational semantics for WP. This AX is not the conventional semantics for WP: it need not be effectively computable or deterministic, for example. A large number of elegant properties of AX are proved and the Floyd-Hoare Principle is reconsidered.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00264252
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Standard model semantics for DSL a data type specification language (1983)
    Springer
    Acta informatica 19 (1983), S. 97-113 
    Details
    ISSN: 1432-0525
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary We discuss a data type specification language DSL(∑) which is obtained from the first order language L(∑) for a given signature ∑ by augmenting it with schemes. A specification is a pair (∑, $$\mathbb{F}$$ ) with $$\mathbb{F}$$ a finite set of axioms in DSL(∑). As semantics of such specifications we propose: standard model semantics, SMS. We investigate DSL/SMS as a specification mechanism for data types and compare it with both first order and algebraic specifications. A concise theory of parametrized data types is developed in this context.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00263930
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    facet.materialart.
    Unknown
    Cancellation Meadows: A Generic Basis Theorem and Some Applications (2012)
    Oxford University Press
    Details
    Publication Date: 2012-12-25
    Description: Let Q 0 denote the rational numbers expanded to a ‘meadow’, that is, after taking its zero-totalized form (0 –1 =0) as the preferred interpretation. In this paper, we consider ‘cancellation meadows’, i.e. meadows without proper zero divisors, such as Q 0 and prove a generic completeness result. We apply this result to cancellation meadows expanded with differentiation operators, the sign function, and with floor, ceiling and a signed variant of the square root, respectively. We give an equational axiomatization of these operators and thus obtain a finite basis for various expanded cancellation meadows.
    Print ISSN: 0010-4620
    Electronic ISSN: 1460-2067
    Topics: Computer Science
    Published by Oxford University Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 10
    facet.materialart.
    Unknown
    Process Algebra with Iteration and Nesting (1994)
    Oxford University Press
    Details
    Publication Date: 1994-04-01
    Print ISSN: 0010-4620
    Electronic ISSN: 1460-2067
    Topics: Computer Science
    Published by Oxford University Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...