227 search results - page 30 / 46 » P Systems and Finite Automata |
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...
CONCUR
1998
Springer
14 years 2 months ago
1998
Springer
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
ECAI
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...
TON
2012
12 years 8 days ago
2012
—Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes that can be detected using a single chip for a reasonable t...
IMECS
2007
13 years 11 months ago
2007
— ACPsrt hs is a hybrid process algebra obtained by extending a combination of two existing extensions of Algebra of Communicating Processes (ACP), namely the process algebra wit...