Sciweavers

93 search results - page 12 / 19
» Timed Unfoldings for Networks of Timed Automata
Sort
View
GLOBECOM
2010
IEEE
14 years 9 months ago
Independent Parallel Compact Finite Automatons for Accelerating Multi-String Matching
Multi-string matching is a key technique for implementing network security applications like Network Intrusion Detection Systems (NIDS) and anti-virus scanners. Existing DFA-based ...
Yi Tang, Junchen Jiang, Xiaofei Wang, Bin Liu, Yan...
FAC
2008
139views more  FAC 2008»
14 years 11 months ago
Network invariants for real-time systems
We extend the approach of model checking parameterized networks of processes by means of network invariants to the setting of real-time systems. We introduce timed transition stru...
Olga Grinchtein, Martin Leucker
FSTTCS
2010
Springer
14 years 9 months ago
Model checking time-constrained scenario-based specifications
We consider the problem of model checking message-passing systems with real-time requirements. As behavioural specifications, we use message sequence charts (MSCs) annotated with ...
S. Akshay, Paul Gastin, Madhavan Mukund, K. Naraya...
SAGA
2005
Springer
15 years 5 months ago
Self-replication, Evolvability and Asynchronicity in Stochastic Worlds
We consider temporal aspects of self-replication and evolvability – in particular, the massively asynchronous parallel and distributed nature of living systems. Formal views of s...
Chrystopher L. Nehaniv
88
Voted
FAC
2007
122views more  FAC 2007»
14 years 11 months ago
Formal techniques for performance analysis: blending SAN and PEPA
Abstract. In this paper we consider two performance modelling techniques from the perspectives of model construction, generation of an underlying continuous time Markov process, an...
Jane Hillston, Leïla Kloul