feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 11
    UID:
    gbv_595127347
    Format: Online-Ressource (VIII, 723 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540472186
    Series Statement: Lecture notes in computer science 600
    Content: An old-fashioned recipe for real time -- Verifying automata specifications of probabilistic real-time systems -- The theory of timed automata -- Logics and models of real time: A survey -- The state operator in real time process algebra -- Timed process algebras with urgent interactions and a unique powerful binary operator -- Time in state based formal description techniques for distributed systems -- Real-time and the Mu-Calculus (preliminary report) -- Implementing reactive programs on circuits a hardware implementation of LUSTRE -- Semantics and completeness of Duration Calculus -- Timed transition systems -- Compositional verification of real-time systems using extended Hoare triples -- Semantics of reactive systems in abstract time -- Problems, promises and performance: some questions for real-time system specification -- Abstraction in real time process algebra -- (Real) time: A philosophical perspective -- Specification and analysis of resource-bound real-time systems -- Forward and backward simulations for timing-based systems -- Prom timed to hybrid systems -- Coping with implementation dependencies in real-time system verification -- Validating real-time systems by executing logic specifications -- An overview and synthesis on timed process algebras -- From ATP to timed graphs and hybrid systems -- Verification of safety critical systems using TTM/RTTL -- Predicative specification of timed processes -- Putting time into proof outlines -- Timed CSP: Theory and practice -- A specification of the cat and mouse problem -- Layering and action refinement for timed systems.
    Content: In the past decade, the formal theory of specification, verfication and development of real-time programs has grown from work of a few specialized groups to a real "bandwagon". Many eminent research groups have shifted their interests in this direction. Consequently, research in real-time is now entering established research areas in formal methods, such as process algebra, temporal logic, and model checking. This volume contains the proceedings of a workshop dedicated to the theory of real-time with the purpose of stepping back and viewing the results achieved as well as considering the directions of ongoing research. The volume gives a representative picture of what is going on in the field worldwide, presented by eminent, active researchers. The material in the volume was prepared by the authors after the workshop took place and reflects the results of the workshop discussions.
    Note: Literaturangaben
    Additional Edition: ISBN 3540555641
    Additional Edition: ISBN 9783540555643
    Additional Edition: Druckausg. Real-time: theory in practice Berlin : Springer, 1992 ISBN 3540555641
    Additional Edition: ISBN 0387555641
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    RVK:
    Keywords: Echtzeitverarbeitung ; Echtzeitsystem ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 12
    UID:
    gbv_595132367
    Format: Online-Ressource (VIII, 671 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540393467
    Series Statement: Lecture notes in computer science 85
    Content: How to get rid of pseudoterminals -- Test sets for homomorphism equivalence on context free languages -- Languages with homomorphic replacements -- Functions equivalent to integer multiplication -- Languages with reducing reflexive types -- Semantics of unbounded nondeterminism -- A shifting algorithm for min-max tree partitioning -- A characterisation of computable data types by means of a finite equational specification method -- A note on sweeping automata -- Border rank of a p×q×2 tensor and the optimal approximation of a pair of bilinear forms -- Derivations et reductions dans les grammaires algebrioues -- Semantic analysis of communicating sequential processes -- Dos systems and languages -- Algebraic implementation of abstract data types: concept, syntax, semantics and correctness -- Parameterized data types in algebraic specification languages -- Characterizing correctness properties of parallel programs using fixpoints -- Formal properties of one-visit and multi-pass attribute grammars (extended abstract) -- Cryptocomplexity and NP-completeness -- On the analysis of tree-matching algorithms -- Generating and searching sets induced by networks -- The complexity of the inequivalence problem for regular expressions with intersection -- An almost linear time algorithm for computing a dependency basis in a relational data base -- Bipolar synchronization systems -- Testing of properties of finite algebras -- A transaction model -- On observing nondeterminism and concurrency -- Terminal algebra semantics and retractions for abstract data types -- The complexity of semilinear sets -- A theory of nondeterminism -- A representation theorem for models of *-free PDL -- Present-day Hoare-like systems for programming languages with procedures: Power, limits and most likely extensions -- Symmertric space-bounded computation (extended abstract) -- On some properties of local testability -- Semantics :Algebras,fixed points,axioms -- Measuring the expressive power of dynamic logics: An application of abstract model theory -- Pebbling mountain ranges and its application to DCFL-recognition -- Space-restricted attribute grammars -- A constructive approach to compiler correctness -- A worst-case analysis of nearest neighbor searching by projection -- Proprietes syntactiques du produit non ambigu -- On the optimal assignment of attributes to passes in multi-pass attribute evaluators -- Optimal unbounded search strategies -- A "fast implementation" of a multidimensional storage into a tree storage -- Grammatical families -- Partitioned chain grammars -- An improved program for constructing open hash tables -- On the power of commutativity in cryptography -- Characterizations of the LL(k) property -- Computability in categories -- On the size complexity of monotone formulas -- Reversible computing -- The use of metasystem transition in theorem proving and program optimization -- On the power of real-time turing machines under varying specifications.
    Note: Literaturangaben
    Additional Edition: ISBN 3540100032
    Additional Edition: ISBN 0387100032
    Additional Edition: ISBN 9783540100034
    Additional Edition: Druckausg. Automata, languages and programming Berlin [u.a.] : Springer, 1980 ISBN 3540100032
    Additional Edition: ISBN 0387100032
    Language: English
    Keywords: Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 13
    UID:
    gbv_595130631
    Format: Online-Ressource (XII, 463 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540471813
    Series Statement: Lecture notes in computer science 259
    Content: Executing a program on the MIT Tagged-Token Dataflow architecture -- PARLOG: The language and its applications -- Functional programming and communicating processes -- Garbage collection in a distributed environment -- Decidability of bisimulation equivalence for processes generating context-free languages -- An approach to programming process interconnection structures: Aggregate rewriting graph grammars -- Specifying functional and timing behavior for real-time applications -- Term graph rewriting -- Towards an intermediate language based on Graph Rewriting -- Distributed garbage collection using reference counting -- Rigorous development of a distributed calendar system -- A reduction semantics for imperative higher-order languages -- Petri net models for algebraic theories of concurrency -- A computational model for distributed systems using operator nets -- Design and proof of communicating sequential processes -- Parallel programming in Temporal Logic -- "Ruth: A functional language for real-time programming" -- A compositional proof theory for real-time distributed message passing -- STREAM: A scheme language for formally describing digital circuits -- A fully abstract semantics for data flow nets -- The concurrent assignment representation of synchronous systems -- A new and efficient implementation of multiprocess synchronization -- Rewriting techniques for the temporal analysis of communicating processes -- Optimistic and-parallelism in Prolog -- An efficient garbage collection scheme for parallel computer architectures -- Task sequencing language for specifying distributed Ada systems TSL-1.
    Note: Literaturangaben
    Additional Edition: ISBN 3540179453
    Additional Edition: ISBN 0387179453
    Additional Edition: ISBN 9783540179450
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783662190180
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783540179450
    Language: English
    Keywords: Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 14
    UID:
    gbv_595128963
    Format: Online-Ressource (X, 808 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540470359
    Series Statement: Lecture notes in computer science 430
    Content: Composing specifications -- Refinement calculus, part I: Sequential nondeterministic programs -- Refinement calculus, part II: Parallel and reactive programs -- MetateM: A framework for programming in temporal logic -- Constraint-oriented specification in a constructive formal description technique -- Functional specification of time sensitive communicating systems -- Modular verification of Petri Nets -- Abadi & Lamport and stark: Towards a proof theory for stuttering, dense domains and refinement mappings -- Algebraic implementation of objects over objects -- Refinement of actions in causality based models -- Transformation of combined data type and process specifications using projection algebras -- Various simulations and refinements -- On decomposing and refining specifications of distributed systems -- Verifying the correctness of AADL modules using model checking -- Specialization in logic programming: From horn clause logic to prolog and concurrent prolog -- Analysis of discrete event coordination -- Refinement and projection of relational specifications -- Compositional theories based on an operational semantics of contexts -- Multivalued possibilities mappings -- Completeness theorems for automata -- Formal verification of data type refinement — Theory and practice -- From trace specifications to process terms -- Some comments on the assumption-commitment framework for compositional verification of distributed programs -- Refinement of concurrent systems based on local state transformations -- Construction of network protocols by stepwise refinement -- A derivation of a broadcasting protocol using sequentially phased reasoning -- Verifying atomic data types -- Predicates, predicate transformers and refinement -- Foundations of compositional program refinement.
    Content: The stepwise refinement method postulates a system construction route that starts with a high-level specification, goes through a number of provably correct development steps, and ends with an executable program. The contributions to this volume survey the state of the art in this extremely active research area. The world's leading specialists in concurrent program specification, verification, and the theory of their refinement present latest research results and surveys of the fields. State-based, algebraic, temporal logic oriented and category theory oriented approaches are presented. Special attention is paid to the relationship between compositionality and refinement for distributed programs. Surveys are given of results on refinement in partial-order based approaches to concurrency. A unified treatment is given of the assumption/commitment paradigm in compositional concurrent program specification and verification, and the extension of these to liveness properties. Latest results are presented on specifying and proving concurrent data bases correct, and deriving network protocols from their specifications.
    Note: Literaturangaben
    Additional Edition: ISBN 3540525599
    Additional Edition: ISBN 9783540525592
    Additional Edition: Druckausg. Stepwise refinement of distributed systems Berlin : Springer, 1990 ISBN 3540525599
    Additional Edition: ISBN 0387525599
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Verteiltes System ; Schrittweise Verfeinerung ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 15
    UID:
    gbv_59513064X
    Format: Online-Ressource (XII, 479 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540471448
    Series Statement: Lecture notes in computer science 258
    Content: Learning translation invariant recognition in a massively parallel networks -- Trace theory and systolic computations -- Boltzmann machines and their applications -- Cobweb-2: Structured specification of a wafer-scale supercomputer -- A novel deadlock free and starvation free packet switching communication processor -- A parallel architecture for signal understanding through inference on uncertain data -- An axiomatic approach to the specification of distributed computer architectures -- Computing on a systolic screen: Hulls, contours and applications -- Multiprocessor systems programming in a high-level data-flow language -- The twisted cube -- An implemented method for incremental systolic design -- The use of parallel functions in system design -- The translation of processes into circuits -- Mapping strategies in message based multiprocessor systems -- Hardware memory management for large knowledge bases -- Transputer-based experiments with the ZAPP architecture -- Synthesis of systolic arrays for inductive problems -- Practical parallelism using transputer arrays -- Systolic array synthesis by static analysis of program dependencies -- Specification of a pipelined event driven simulator using FP2 -- A layered emulator for design evaluation of MIMD multiprocessors with shared memory -- The Alliant FX/Series: A language driven architecture for parallel processing of dusty deck fortran -- Emulating digital logic using transputer networks (very high parallelism = simplicity = performance) -- A two-level approach to logic plus functional programming integration -- Overview of a parallel reduction machine project -- An overview of DDC: Delta driven computer -- Design and implementation of a parallel inference machine for first order logic: an overview -- Multi-level simulator for VLSI -- The DOOM system and its applications: A survey of esprit 415 subproject A, philips research laboratories.
    Note: Literaturangaben
    Additional Edition: ISBN 3540179437
    Additional Edition: ISBN 0387179437
    Additional Edition: ISBN 9783540179436
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783662200902
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783540179436
    Language: English
    Keywords: Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 16
    UID:
    gbv_595129714
    Format: Online-Ressource (VIII, 713 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540461470
    Series Statement: Lecture notes in computer science 354
    Content: Time, logic and computation -- Process theory based on bisimulation semantics -- Branching time temporal logic -- Observing processes -- The anchored version of the temporal framework -- Basic notions of trace theory -- An introduction to event structures -- A logic for the description of behaviours and properties of concurrent systems -- Permutation of transitions: An event structure semantics for CCS and SCCS -- Expressibility results for linear-time and branching-time logics -- Partial orderings descriptions and observations of nondeterministic concurrent processes -- Modeling concurrency by partial orders and nonlinear transition systems -- An efficient verification method for parallel and distributed programs -- A logic for distributed transition systems -- Fully abstract models for a process language with refinement -- Strong bisimilarity on nets: A new concept for comparing net semantics -- Nets of processes and data flow -- Towards a temporal logic for causality and choice in distributed systems -- Correctness and full abstraction of metric semantics for concurrency -- Temporal logics for CCS -- Behavioural presentations -- Computation tree logic and regular ?-languages.
    Content: This volume is based on the "School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency" organized by the editors and held in the period May 30-June 3, 1988 at Noordwijkerhout, The Netherlands. The School/Workshop was an activity of the project REX - Research and Education in Concurrent Systems. The volume contains tutorials and research contributions to the three approaches - linear time, - branching time, and - partial order in semantics and proof theory of concurrent programs by the main specialists in this field. It promotes an in-depth understanding of the relative merits and disadvantages of these three approaches. An introduction to the recent literature on the subject is provided by the invited research contributions.
    Note: Literaturangaben
    Additional Edition: ISBN 354051080X
    Additional Edition: ISBN 038751080X
    Additional Edition: ISBN 9783540510802
    Additional Edition: Druckausg. Linear time, branching time and partial order in logics and models for concurrency Berlin : Springer, 1989 ISBN 354051080X
    Additional Edition: ISBN 038751080X
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    Keywords: Logik ; Nebenläufigkeit ; Nebenläufigkeit ; Konferenzschrift ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 17
    Online Resource
    Online Resource
    Berlin [u.a.] : Springer
    UID:
    gbv_595130984
    Format: Online-Ressource (XII, 716 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540398271
    Series Statement: Lecture notes in computer science 224
    Content: Computer science in industry -- Dataflow and education: Data-driven and demand-driven distributed computation -- Contrasting themes in the semantics of imperative concurrency -- Functional programming and the language tale -- Design, specification and validation of hierarchies of protocols in distributed systems -- Infinitary languages: Basic theory and applications to concurrent systems -- The quest goes on: A survey of proofsystems for partial correctness of CSP -- Logic programming: The foundations, the approach and the role of concurrency -- Process theory: Semantics, specification and verification -- Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends -- Petri nets: Basic notions, structure, behaviour -- Concepts for concurrent programming.
    Note: Literaturangaben
    Additional Edition: ISBN 354016488X
    Additional Edition: ISBN 038716488X
    Additional Edition: ISBN 9783540164883
    Additional Edition: Druckausg. Current trends in concurrency Berlin : Springer, 1986 ISBN 038716488X
    Additional Edition: ISBN 354016488X
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Nebenläufigkeit ; Konferenzschrift ; Konferenzschrift ; Aufsatzsammlung
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 18
    UID:
    gbv_595125379
    Format: Online-Ressource (684 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540484233
    Series Statement: Lecture notes in computer science 803
    Content: Data-flow synchronous languages -- Process algebra with backtracking -- Some Chemical Abstract Machines -- Verification tools for finite-state concurrent systems -- Linear logic on Petri nets -- An introduction to the theoretical aspects of Coloured Petri Nets -- Temporal verification of simulation and refinement -- Verification and specification of concurrent programs -- Simulation techniques for proving properties of real-time systems -- Relationships between models of concurrency -- Interaction diagrams -- Algebraic theories for name-passing calculi -- Initial algebra and final coalgebra semantics for concurrency -- Logical specifications of infinite computations -- Partial order based design of concurrent systems.
    Content: The REX School/Symposium "A Decade of Concurrency - Reflections and Perspectives" was the final event of a ten-year period of cooperation between three Dutch research groups working on the foundations of concurrency. Ever since its inception in 1983, the goal of the project has been to contribute to the cross-fertilization between formal methods from the fields of syntax, semantics, and proof theory, aimed at an improved understanding of the nature of parallel computing. The material presented in this volume was prepared by the lecturers (and their coauthors) after the meeting took place. In total, the volume constitutes a thorough state-of-the-art report of the research activities in concurrency.
    Note: Literaturangaben
    Additional Edition: ISBN 3540580433
    Additional Edition: ISBN 9783540580430
    Additional Edition: Druckausg. A decade of concurrency Berlin : Springer, 1994 ISBN 3540580433
    Additional Edition: ISBN 0387580433
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    RVK:
    Keywords: Nebenläufigkeit ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 19
    UID:
    gbv_1649206585
    Format: Online-Ressource
    ISBN: 9783540471813
    Series Statement: Lecture Notes in Computer Science 259
    Additional Edition: ISBN 9783540179450
    Additional Edition: Buchausg. u.d.T. Parallel languages 1987 ISBN 3540179453
    Additional Edition: ISBN 0387179453
    Language: English
    Subjects: Computer Science
    RVK:
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 20
    UID:
    gbv_1649206542
    Format: Online-Ressource
    ISBN: 9783540471448
    Series Statement: Lecture Notes in Computer Science 258
    Additional Edition: ISBN 9783540179436
    Additional Edition: Buchausg. u.d.T. Parallel architectures 1987 ISBN 3540179437
    Additional Edition: ISBN 0387179437
    Language: English
    Subjects: Computer Science
    RVK:
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages