Sciweavers

264 search results - page 51 / 53
» entcs 2008
Sort
View
ENTCS
2008
110views more  ENTCS 2008»
13 years 7 months ago
Game-Based Probabilistic Predicate Abstraction in PRISM
ion in PRISM1 Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker Oxford University Computing Laboratory, Oxford, UK Modelling and verification of systems such as communi...
Mark Kattenbelt, Marta Z. Kwiatkowska, Gethin Norm...
ENTCS
2011
131views more  ENTCS 2011»
13 years 2 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
Ed Blakey
ENTCS
2008
153views more  ENTCS 2008»
13 years 7 months ago
Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
ENTCS
2008
91views more  ENTCS 2008»
13 years 7 months ago
Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems
Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction ...
Mario Bravetti
ENTCS
2008
106views more  ENTCS 2008»
13 years 7 months ago
Modelling Adaptive Systems in ForSyDe
Emerging architectures such as partially reconfigurable FPGAs provide a huge potential for adaptivity in the area of embedded systems. Since many system functions are only execute...
Ingo Sander, Axel Jantsch