CONCUR '98 Concurrency Theory 9th International Conference, Nice, France, September 8-11, 1998, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Sangiorgi, Davide (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Simone, Robert de (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
• Έκδοση: 1st ed. 1998.
• Σειρά: Lecture Notes in Computer Science, 1466
• Θέματα: Programming languages (Electronic computers).; Computer logic.; Computers.; Computer programming.; Computer communication systems.; Programming Languages, Compilers, Interpreters.; Logics and Meanings of Programs.; Computation by Abstract Devices.; Programming Techniques.; Computer Communication Networks.

 This book constitutes the refereed proceedings of the 9th International Conference on Concurrency Theory, CONCUR'98, held in Nice, France, in September 1998. The 35 revised full papers presented were carefully selected from a total of 104 submissions. Also presented are five invited contributions. Among the topics covered are moduls of computation and semantic domains, process algebras, Petri Nets, event structures, real-time systems, hybrid systems, model checking, verification techniques, refinement, rewriting, typing systems and algorithms, etc. 

 Sometimes and not never re-revisited: on branching versus linear time -- Controllers for discrete event systems via morphisms -- Synthesis from knowledge-based specifications -- The regular viewpoint on PA-processes -- Herbrand automata for hardware verification -- Control flow analysis for the ?-calculus -- The tau-laws of fusion -- From higher-order ?-calculus to ?-calculus in the presence of static operators -- Minimality and separation results on asynchronous mobile processes -- Abstract games for infinite state processes -- Alternating refinement relations -- Possible worlds process algebras -- Automata and coinduction (an exercise in coalgebra) -- Axioms for real-time logics -- Priority and maximal progress are completely axiomatisable (extended abstract) -- Simulation is decidable for one-counter nets -- From rewrite to bisimulation congruences -- Reasoning about asynchronous communication in dynamically evolving object structures -- Modelling IP mobility -- Reduction in TLA -- Detecting deadlocks in concurrent systems -- Unfold/fold transformations of CCP programs -- Type systems for concurrent calculi -- Stochastic process algebras benefits for performance evaluation and challenges -- Algebraic techniques for timed systems -- Probabilistic resource failure in real-time process algebra -- Towards performance evaluation with general distributions in process algebras -- Stochastic transition systems -- It's about time: Real-time logics reviewed -- Controlled timed automata -- On discretization of delays in timed automata and digital circuits -- Partial order reductions for timed systems -- Unfolding and finite prefix for nets with read arcs -- Asynchronous cellular automata and asynchronous automata for pomsets -- Deriving unbounded Petri nets from formal languages -- Decompositions of asynchronous systems -- Synthesis of ENI-systems using minimal regions -- A categorical axiomatics for bisimulation -- Fibrational semantics of dataflow networks -- A relational model of non-deterministic dataflow -- Checking verifications of protocols and distributed systems by computer.