Sciweavers

883 search results - page 6 / 177
» The Semantics of Verilog Using Transition System Combinators
Sort
View
MFCS
2007
Springer
14 years 1 months ago
Transition Graphs of Rewriting Systems over Unranked Trees
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
Christof Löding, Alex Spelten
HYBRID
2010
Springer
13 years 5 months ago
Timed I/O automata: a complete specification theory for real-time systems
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design...
Alexandre David, Kim G. Larsen, Axel Legay, Ulrik ...
ACMICEC
2006
ACM
191views ECommerce» more  ACMICEC 2006»
14 years 1 months ago
An ontology of trust: formal semantics and transitivity
This paper formalizes the semantics of trust and studies the transitivity of trust. On the Web, people and software agents have to interact with “strangers”. This makes trust ...
Jingwei Huang, Mark S. Fox
HYBRID
1997
Springer
13 years 12 months ago
Time-Deterministic Hybrid Transition Systems
Hybrid transition systems in their full generality describe continuous behaviour by a set of equations in each mode an algebraic or di erential equation for each state variable in ...
Simin Nadjm-Tehrani
MM
2009
ACM
220views Multimedia» more  MM 2009»
14 years 11 days ago
Multi-modal scene segmentation using scene transition graphs
In this work the problem of automatic decomposition of video into elementary semantic units, known in the literature as scenes, is addressed. Two multi-modal automatic scene segme...
Panagiotis Sidiropoulos, Vasileios Mezaris, Ioanni...