Information Processing Letters
Temporal predicate transforms and fair termination
Acta Informatica
A predicate transformer for progress
Information Processing Letters
Duality in specification languages: a lattice-theoretical approach
Acta Informatica
Programming from specifications
Programming from specifications
Completing the temporal picture
Selected papers of the 16th international colloquium on Automata, languages, and programming
A model of concurrency with fair merge and full recursion
Information and Computation
Operational semantics and generalized weakest preconditions
Science of Computer Programming - Special issue on mathematics of program construction
Information Processing Letters - Special issue on the calculational method
Automated temporal reasoning about reactive systems
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Contracts, games, and refinement
Information and Computation - Special issue on EXPRESS 1997
A Discipline of Programming
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Realizable and Unrealizable Specifications of Reactive Systems
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Contracts as Mathematical Entities in Programming Logic
Contracts as Mathematical Entities in Programming Logic
Verification and Refinement of Action Contracts
Verification and Refinement of Action Contracts
| Hi-index | 0.00 |
Contracts have been introduced earlier as a way of modeling a collection of agents that work within the limits set by the contract. We have analyzed the question of when an agent or a coalition of agents can reach a stated goal, despite potentially hostile behavior by the other agents. In this paper, we extend the model so that we can also study whether a coalition of agents can enforce a certain temporal behavior when executing a contract. We show how to reduce this question to the question of whether a given goal can be achieved. We introduce a generalization of the action system notation that allows both angelic and demonic scheduling of actions. This allows us to model concurrent systems and interactive systems in the same framework, and show that one can be seen as the dual of the other. We analyze enforcement of temporal behavior in the case of action systems, and show that these provide for simpler proof obligations than what we get in the general case. Finally, we give three illustrative examples of how to model and analyze interactive and concurrent systems with this approach.