Institut für Informatik
Filtern
Erscheinungsjahr
- 2010 (18) (entfernen)
Dokumenttyp
- Diplomarbeit (6)
- Ausgabe (Heft) zu einer Zeitschrift (6)
- Studienarbeit (4)
- Bachelorarbeit (1)
- Dissertation (1)
Schlagworte
- Netzwerk (2)
- Routing (2)
- hybrid automata (2)
- API (1)
- Algorithm Engineering (1)
- Authentisierung (1)
- Automatisches Beweisverfahren (1)
- Computational logic (1)
- Context-aware processes (1)
- Controlling (1)
- Description Logics (1)
- Dijkstras Algorithmus (1)
- Distributed process execution (1)
- E-KRHyper (1)
- GPS (1)
- Heuristiken (1)
- JML (1)
- Java Modeling Language (1)
- Java. Programmiersprache (1)
- Klausellogik (1)
- Knowledge Compilation (1)
- Konvergenz (1)
- Mikrocontroller (1)
- Monitoring (1)
- Multiagentensysteme (1)
- Network (1)
- Netzwerk Protokollen (1)
- Neuronales Netz (1)
- Oracle Generation (1)
- Oraklegenerierung (1)
- Personal Key Infrastruktur (1)
- Petri net (1)
- Probability propagation nets (1)
- Process tracing (1)
- Projekt iCity (1)
- Protocol (1)
- Prädikatenlogik (1)
- RIP (1)
- RMTI (1)
- Rechnernetz (1)
- Software Engineering (1)
- Softwaretest (1)
- Softwaretesting (1)
- Spannender Baum (1)
- Spanning Tree (1)
- Specification (1)
- Spezifikation (1)
- Statistische Analyse (1)
- Tableau <Logik> (1)
- Test Generation (1)
- Testgenerierung (1)
- VNUML (1)
- Wireshark (1)
- XTPeer (1)
- Zertifikat (1)
- andLinux (1)
- andLinux. (1)
- backpropagation (1)
- bias (1)
- constraint logic programming (1)
- convergence analysis (1)
- ediv (1)
- hybride Automaten (1)
- iCity project (1)
- multi-agent systems (1)
- multiagent systems (1)
- networks (1)
- neural (1)
- privacy protection (1)
- public key infrastructure (1)
- recurrent (1)
- rip (1)
- rmti (1)
- vnuml (1)
- xtpeer (1)
Institut
- Institut für Informatik (18)
- Fachbereich 4 (6)
Hybrid automata are used as standard means for the specification and analysis of dynamical systems. Several researches have approached them to formally specify reactive Multi-agent systems situated in a physical environment, where the agents react continuously to their environment. The specified systems, in turn, are formally checked with the help of existing hybrid automata verification tools. However, when dealing with multi-agent systems, two problems may be raised. The first problem is a state space problem raised due to the composition process, where the agents have to be parallel composed into an agent capturing all possible behaviors of the multi-agent system prior to the verification phase. The second problem concerns the expressiveness of verification tools when modeling and verifying certain behaviors. Therefore, this paper tackles these problems by showing how multi-agent systems, specified as hybrid automata, can be modeled and verified using constraint logic programming(CLP). In particular, a CLP framework is presented to show how the composition of multi-agent behaviors can be captured dynamically during the verification phase. This can relieve the state space complexity that may occur as a result of the composition process. Additionally, the expressiveness of the CLP model flexibly allows not only to model multi-agent systems, but also to check various properties by means of the reachability analysis. Experiments are promising to show the feasibility of our approach.