Sciweavers

29 search results - page 2 / 6
» Decomposing port automata
Sort
View
FORMATS
2007
Springer
13 years 9 months ago
Partial Order Reduction for Verification of Real-Time Components
Abstract. We describe a partial order reduction technique for a realtime component model. Components are described as timed automata with data ports, which can be composed in stati...
John Håkansson, Paul Pettersson
ASPLOS
2000
ACM
13 years 10 months ago
Communication Scheduling
The high arithmetic rates of media processing applications require architectures with tens to hundreds of functional units, multiple register files, and explicit interconnect betw...
Peter R. Mattson, William J. Dally, Scott Rixner, ...
CORR
2010
Springer
91views Education» more  CORR 2010»
13 years 5 months ago
Simulations of Weighted Tree Automata
Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called f...
Zoltán Ésik, Andreas Maletti
TCS
2008
13 years 5 months ago
On the structure of graphs in the Caucal hierarchy
We investigate the structure of graphs in the Caucal hierarchy. We provide criteria concerning the degree of vertices or the length of paths which can be used to show that a given ...
Achim Blumensath
ENTCS
2006
173views more  ENTCS 2006»
13 years 5 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal