Sciweavers

20126 search results - page 127 / 4026
» Timed Transition Systems
Sort
View
106
Voted
APLAS
2004
ACM
15 years 8 months ago
Network Fusion
Modular programming enjoys many well-known advantages: readability, maintainability, separate development and compilation. However, the composition of modular units (components) s...
Pascal Fradet, Stéphane Hong Tuan Ha
LICS
2005
IEEE
15 years 9 months ago
Proof-Theoretic Approach to Description-Logic
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
Martin Hofmann
OPODIS
2010
15 years 1 months ago
Failure Detectors Encapsulate Fairness
Failure detectors are commonly viewed as abstractions for the synchronism present in distributed system models. However, investigations into the exact amount of synchronism encapsu...
Scott M. Pike, Srikanth Sastry, Jennifer L. Welch
113
Voted
ENTCS
2007
121views more  ENTCS 2007»
15 years 3 months ago
An Account of Implementing Applicative Term Rewriting
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation ...
Muck van Weerdenburg
151
Voted
FORMATS
2008
Springer
15 years 5 months ago
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
Time dependant models have been intensively studied for many reasons, among others because of their applications in software verification and due to the development of embedded pla...
Jirí Srba