Sciweavers

50 search results - page 3 / 10
» The Second Contest on Multi-Agent Systems Based on Computati...
Sort
View
LOPSTR
2009
Springer
14 years 5 days ago
Deciding Full Branching Time Logic by Program Transformation
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
ENTCS
2006
146views more  ENTCS 2006»
13 years 5 months ago
Relating State-Based and Process-Based Concurrency through Linear Logic
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are noto...
Iliano Cervesato, Andre Scedrov
JELIA
1998
Springer
13 years 9 months ago
A Logic for Anytime Deduction and Anytime Compilation
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
Frédéric Koriche
DBSEC
2008
136views Database» more  DBSEC 2008»
13 years 7 months ago
An Opinion Model for Evaluating Malicious Activities in Pervasive Computing Systems
Pervasive computing applications typically involve cooperation among a number of entities spanning multiple organizations. Any security breach in any single entity can have very fa...
Indrajit Ray, Nayot Poolsappasit, Rinku Dewri
CONCUR
2004
Springer
13 years 11 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
Paolo Baldan, Andrea Corradini, Barbara König