CONCUR '98 : concurrency theory : 9th International Conference, Nice, France, September 8-11, 1998 : proceedings
著者
書誌事項
CONCUR '98 : concurrency theory : 9th International Conference, Nice, France, September 8-11, 1998 : proceedings
(Lecture notes in computer science, 1466)
Springer, c1998
大学図書館所蔵 全44件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references and index
内容説明・目次
内容説明
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.
「Nielsen BookData」 より