233 search results - page 16 / 47 » Equivalent Transformations of Automata by Using Behavioural ... |
IFM
2007
Springer
14 years 1 months ago
2007
Springer
The Behavior Tree notation has been developed as a method for systematically and traceably capturing user requirements. In this paper we extend the notation with probabilistic beha...
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
In this paper4 , we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly in...
CPAIOR
2009
Springer
14 years 2 months ago
2009
Springer
An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the REGULAR and GRAMMAR constraints specify constraints ...
TCS
2002
13 years 7 months ago
2002
An operation M which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata r...
BIOCOMP
2009
13 years 5 months ago
2009
Abstract-- Spatial partial differential equations are commonly used to describe systems of biological entities, such as patterns created by desert vegetation and biovermiculation g...