Authors
Martín Abadi, Leslie Lamport, Pierre Wolper
Publication date
1989
Journal
Automata, languages and programming
Pages
1-17
Publisher
Springer Berlin/Heidelberg
Description
A specification is useless if it cannot be realized by any concrete implementation. There are obvious reasons why it might be unrealizable: it might require the computation of a nonrecursive function, or it might be logically inconsistent. A more subtle danger is specifying the behavior of part of the universe outside the implementor's control. This source of unreaiizability is most likely to infect specifications of concurrent systems or reactive systems [HP85]. It is this source of unrealizability that concerns us.
Formally, a specification is a set of sequences of states, which represents the set of allowed behaviors of a system. We do not distinguish between specifications and programs; a Pascal program and a temporal logic specification are both specifications, although one is at a lower level than the other.(Some may wonder which is the lowerlevel one.) A specification S1 is said to implement a specification S2 iff (if and only if …
Total citations
1989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320244697951687104141116201817121413181114161921261117159331293
Scholar articles
M Abadi, L Lamport, P Wolper - International Colloquium on Automata, Languages …, 1989
M Abadi, L Lamport, P Wolper - Proc. 16th Int. Colloquium on Automata, Languages …, 1989