Sciweavers

201 search results - page 19 / 41
» On the Decidability of Model-Checking for P Systems
Sort
View
109
Voted
IFIP13
2004
15 years 3 months ago
Analysing Dynamic Function Scheduling Decisions
: Function allocation, as a process used in the construction of dependable complex systems, is a significant aspect of the design and implementation of interactive systems. It invo...
Karsten Loer, Michael Hildebrandt, Michael D. Harr...
121
Voted
IANDC
2008
112views more  IANDC 2008»
15 years 1 months ago
Inclusion dynamics hybrid automata
Hybrid systems are dynamical systems with the ability to describe mixed discretecontinuous evolution of a wide range of systems. Consequently, at first glance, hybrid systems appe...
Alberto Casagrande, Carla Piazza, Alberto Policrit...
ATAL
2008
Springer
15 years 3 months ago
Quantifying over coalitions in epistemic logic
Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agent...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
JUCS
2007
122views more  JUCS 2007»
15 years 1 months ago
Spiking Neural P Systems with Astrocyte-Like Control
: Spiking neural P systems are computing models inspired from the way the neurons communicate by means of spikes, electrical impulses of identical shapes. In this note we consider ...
Gheorghe Paun
126
Voted
ATAL
2010
Springer
15 years 2 months ago
Verifying agents with memory is harder than it seemed
ATL+ is a variant of alternating-time temporal logic that does not have the expressive power of full ATL , but still allows for expressing some natural properties of agents. It ha...
Nils Bulling, Wojciech Jamroga