Sciweavers

1202 search results - page 89 / 241
» Sortings for Reactive Systems
Sort
View
TACAS
2007
Springer
91views Algorithms» more  TACAS 2007»
15 years 10 months ago
Planned and Traversable Play-Out: A Flexible Method for Executing Scenario-Based Programs,
We introduce a novel approach to the smart execution of scenario-based models of reactive systems, such as those resulting from the multi-modal inter-object language of live sequen...
David Harel, Itai Segall
CDC
2009
IEEE
15 years 8 months ago
Synthesis of positive-real functions with low-complexity series-parallel networks
— The purpose of this paper is to continue to develop the recently introduced concept of a regular positivereal function and its application to the classification of lowcomplexi...
Jason Zheng Jiang, Malcolm C. Smith
CONCUR
2001
Springer
15 years 8 months ago
Bounded Reachability Checking with Process Semantics
Bounded model checking has been recently introduced as an efficient verification method for reactive systems. In this work we apply bounded model checking to asynchronous systems....
Keijo Heljanko
CAV
2008
Springer
80views Hardware» more  CAV 2008»
15 years 6 months ago
Ranking Automata and Games for Prioritized Requirements
Requirements of reactive systems are usually specified by classifying system executions as desirable and undesirable. To specify prioritized requirements, we propose to associate a...
Rajeev Alur, Aditya Kanade, Gera Weiss
ENTCS
2006
112views more  ENTCS 2006»
15 years 4 months ago
Synchronous Dataflow Pattern Matching
We introduce variant types and a pattern matching operation to synchronous dataflow languages. These languages are used in the design of reactive systems. As these systems grow in...
Grégoire Hamon