Sciweavers

233 search results - page 3 / 47
» Equivalent Transformations of Automata by Using Behavioural ...
Sort
View
SEFM
2006
IEEE
13 years 11 months ago
Product Automata and Process Algebra
We define a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is defin...
Kamal Lodaya
ENTCS
2008
105views more  ENTCS 2008»
13 years 5 months ago
Checking Equivalence for Reo Networks
Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of...
Tobias Blechmann, Christel Baier
ICFEM
2009
Springer
13 years 3 months ago
An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata
Bounded timed-arc Petri nets with read-arcs were recently proven equivalent to networks of timed automata, though the Petri net model cannot express urgent behaviour and the descri...
Joakim Byg, Kenneth Yrke Jørgensen, Jir&iac...
ENTCS
2007
70views more  ENTCS 2007»
13 years 5 months ago
Component Substitutability via Equivalencies of Component-Interaction Automata
We provide a new look at formal aspects of component substitutability (replacement of a component with a new one) and independent implementability (reuse of a component in any sys...
Ivana Cerná, Pavlína Vareková...
FSTTCS
2009
Springer
14 years 9 days ago
Automata and temporal logic over arbitrary linear time
Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running sys...
Julien Cristau