415 search results - page 8 / 83 » Regular Processes and Timed Automata |
144
Voted
EPK
2006
15 years 4 months ago
2006
Abstract: Event-driven Process Chains (EPCs) are a commonly used modelling technique for design and documentation of business processes. Although EPCs have an easy-to-understand no...
137
Voted
CONCUR
2006
Springer
15 years 5 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
124
Voted
LATA
2010
Springer
16 years 25 days ago
2010
Springer
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...
127
click to vote
CONCUR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We propose a model of distributed timed systems where each component is a timed automaton with a set of local clocks that evolve at a rate independent of the clocks of th...
132
Voted
RTSS
1999
IEEE
15 years 7 months ago
1999
IEEE
This paper presents a process algebra for specifying soft real-time constraints in a compositional way. For these soft constraints we take a stochastic point of view and allow arb...