Sciweavers

756 search results - page 121 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
MVA
2006
205views Computer Vision» more  MVA 2006»
13 years 8 months ago
Ontological inference for image and video analysis
Abstract This paper presents an approach to designing and implementing extensible computational models for perceiving systems based on a knowledge-driven joint inference approach. ...
Christopher Town
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 5 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
CASES
2005
ACM
13 years 10 months ago
An Esterel processor with full preemption support and its worst case reaction time analysis
The concurrent synchronous language Esterel allows proto treat reactive systems in an abstract, concise manner. An Esterel program is typically first translated into other, non-s...
Xin Li, Jan Lukoschus, Marian Boldt, Michael Harde...
STTT
2010
122views more  STTT 2010»
13 years 6 months ago
Rodin: an open toolset for modelling and reasoning in Event-B
Event-B is a formal method for system-level modelling and analysis. Key features of Event-B are the use of set theory as a modelling notation, the use of ent to represent systems a...
Jean-Raymond Abrial, Michael J. Butler, Stefan Hal...
ACSD
2010
IEEE
197views Hardware» more  ACSD 2010»
13 years 6 months ago
Order-Independence of Vector-Based Transition Systems
Abstract--Semantics of many specification languages, particularly those used in the domain of hardware, is described in terms of vector-based transition systems. In such a transiti...
Matthias Raffelsieper, Mohammad Reza Mousavi, Hans...