CONCUR '92
Editat de Walter R. Cleavelanden Limba Engleză Paperback – 12 aug 1992
Preț: 634.01 lei
Preț vechi: 745.90 lei
-15%
Puncte Express: 951
Preț estimativ în valută:
112.11€ • 128.56$ • 96.89£
112.11€ • 128.56$ • 96.89£
Carte tipărită la comandă
Livrare economică 28 aprilie-12 mai
Specificații
ISBN-13: 9783540558224
ISBN-10: 3540558225
Pagini: 596
Ilustrații: X, 586 p.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.89 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540558225
Pagini: 596
Ilustrații: X, 586 p.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.89 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
The polyadic ?-calculus.- Testing equivalence for mobile processes.- Testing equivalence for Petri Nets with action refinement: Preliminary report.- The problem of “weak bisimulation up to”.- On the uniqueness of fixpoints modulo observation congruence.- Verification of parallel systems via decomposition.- Interface refinement in reactive systems.- Concurrent testing of processes.- A theory of processes with localities.- Model checking for context-free processes.- Bisimulation equivalence is decidable for all context-free processes.- Distributed bisimularity is decidable for a class of infinite state-space systems.- How vital is liveness? Verifying timing properties of reactive and hybrid systems.- Preserving specific properties in program development.- Sometimes ‘some’ is as good as ‘all’.- The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic.- Propositional temporal logics and equivalences.- The duality of time and information.- Homology of higher dimensional automata.- Posets for configurations!.- On the semantics of Petri Nets.- Structural operational specifications and trace automata.- At-most-once message delivery A case study in algorithm verification.- Games I/O automata play.- Minimization of timed transition systems.- Using CSP to verify a timed protocol over a fair medium.- Timed Ethernet: Real-time formal specification of Ethernet.- Implementing LOTOS specifications by communicating state machines.- Discrete time process algebra.- The silent step in time.- Action transducers and timed automata.- Compositional verification of probabilistic processes.- Axiomatizing probabilistic processes: ACP with generative probabilities.- Embeddings among concurrent programming languages.- Logic of trace languages.-Multiway synchronization verified with coupled simulation.- Programming in a general model of synchronization.- Operational and compositional semantics of synchronous automaton compositions.- Towards a theory of actor computation.