Sciweavers

73 search results - page 12 / 15
» A Coalgebraic Theory of Reactive Systems
Sort
View
ESORICS
2002
Springer
14 years 7 months ago
Formal Security Analysis with Interacting State Machines
We introduce the ISM approach, a framework for modeling and verifying reactive systems in a formal, even machine-checked, way. The framework has been developed for applications in ...
David von Oheimb, Volkmar Lotz
CORR
2011
Springer
195views Education» more  CORR 2011»
13 years 2 months ago
Abstract Processes of Place/Transition Systems
Processes of Place/Transition Systems6 Rob van Glabbeeka,b , Ursula Goltzc , Jens-Wolfhard Schickec aNICTA, Sydney, Australia bSchool of Computer Science and Engineering, Universit...
Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard S...
CONTEXT
2001
Springer
13 years 12 months ago
A Connectionist-Symbolic Approach to Modeling Agent Behavior: Neural Networks Grouped by Contexts
A recent report by the National Research Council (NRC) declares neural networks “hold the most promise for providing powerful learning models”. While some researchers have expe...
Amy E. Henninger, Avelino J. Gonzalez, Michael Geo...
ICFP
2003
ACM
14 years 7 months ago
Functional automatic differentiation with dirac impulses
Functional Reactive Programming (FRP) is a framework for reactive programming in a functional setting. FRP has been applied to a number of domains, such as graphical animation, gr...
Henrik Nilsson
LICS
1997
IEEE
13 years 11 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...