Timed Automata Semantics for Visual e-Contracts

Details Timed Automata Semantics for Visual e-Contracts Timed Automata Semantics for Visual e-Contracts

2011-09-13

arxiv.org/abs/1109.2654v1

EPTCS 68, 2011, pp. 7-21

Computer Science

Logic in Computer Science

In Proceedings FLACOS 2011, arXiv:1109.2399

Scientific paper

10.4204/EPTCS.68.3

C-O Diagrams have been introduced as a means to have a more visual representation of electronic contracts, where it is possible to represent the obligations, permissions and prohibitions of the different signatories, as well as what are the penalties in case of not fulfillment of their obligations and prohibitions. In such diagrams we are also able to represent absolute and relative timing constraints. In this paper we present a formal semantics for C-O Diagrams based on timed automata extended with an ordering of states and edges in order to represent different deontic modalities.

Affiliated with

Also associated with

No associations

Rating

Timed Automata Semantics for Visual e-Contracts does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Timed Automata Semantics for Visual e-Contracts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Timed Automata Semantics for Visual e-Contracts will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-332964