1167 search results - page 151 / 234 » A Really Temporal Logic |
151
Voted
ATVA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The bounded synthesis problem is to construct an implementation that satisfies a given temporal specification and a given bound on the number of states. We present a so...
144
click to vote
ICLP
2003
Springer
15 years 9 months ago
2003
Springer
Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in...
191
click to vote
SPIN
2001
Springer
15 years 9 months ago
2001
Springer
p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations conform to the input syntax of the wi...
140
click to vote
FTDCS
2004
IEEE
15 years 8 months ago
2004
IEEE
Web services are essentially black box components from a composer's or a mediator's perspective. The behavioural description of any service can be asserted by the compos...
154
click to vote
DALT
2009
Springer
15 years 8 months ago
2009
Springer
The specification and monitoring of conditional obligations and prohibitions with starting points and deadlines is a crucial aspect in the design of open interaction systems. In th...