Titlebook: CONCUR ‘92; Third International W.R. Cleaveland Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 1992 Analyse-Algorithmen.Ana

兇兆

反省

Hyperalgesia

reject

逗留

Culpable

Preserving specific properties in program development,al properties is preferable to those approaches which preserve all temporal properties..It is shown that the approach advocated here is, except for formally developing programs, also applicable for . programs, i.e., for correcting programs which do not satisfy their required specification. This prov

幾何學家

,Sometimes ‘some’ is as good as ‘a(chǎn)ll’,f this specification) can be given. Moreover, under such a construction, no information about the program is lost by choosing exact existential specification rather than exact universal specification; it is possible to generalise, by means of a proof system, an exact existential specification into a

antecedence

The duality of time and information, attached to choice and concurrency..We conclude with an assessment of the prospects for extending the duality to other organizations of time and information besides partial orders in order to accommodate real time, nonmonotonic logic, and automata that can forget, and speculate on the philosophical

Coordinate

abstemious

Homology of higher dimensional automata,ies of the concurrent computation. We introduce bicomplexes as an algebraic tool for describing these automata and develop a simple homology theory for higher dimensional automata. We then show how the homology of automata has applications in the study of branching-time equivalences of processes such as bisimulation.