Sciweavers

1167 search results - page 151 / 234
» A Really Temporal Logic
Sort
View
ATVA
2007
Springer
152views Hardware» more  ATVA 2007»
15 years 7 months ago
Bounded Synthesis
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...
Sven Schewe, Bernd Finkbeiner
124
Voted
ICLP
2003
Springer
15 years 6 months ago
Concurrency, Time, and Constraints
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...
Frank D. Valencia
SPIN
2001
Springer
15 years 6 months ago
p2b: A Translation Utility for Linking Promela and Symbolic Model Checking (Tool Paper)
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...
Michael Baldamus, Jochen Schröder-Babo
FTDCS
2004
IEEE
15 years 5 months ago
Introducing Compositionality in Web Service Descriptions
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...
Monika Solanki, Antonio Cau, Hussein Zedan
DALT
2009
Springer
15 years 5 months ago
Ontology and Time Evolution of Obligations and Prohibitions Using Semantic Web Technology
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...
Nicoletta Fornara, Marco Colombetti