Buch, Englisch, Band 1466, 663 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1007 g
9th International Conference, Nice, France, September 8-11, 1998, Proceedings
Buch, Englisch, Band 1466, 663 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1007 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-64896-3
Verlag: Springer Berlin Heidelberg
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..
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Compiler
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmier- und Skriptsprachen
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Prozedurale Programmierung
- Mathematik | Informatik EDV | Informatik Technische Informatik Netzwerk-Hardware
- Mathematik | Informatik EDV | Informatik Technische Informatik Externe Speicher & Peripheriegeräte
Weitere Infos & Material
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 ofasynchronous 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.
