Sciweavers

215 search results - page 7 / 43
» On Abstract Finite-State Morphology
Sort
View
DAC
1996
ACM
14 years 21 days ago
A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines
Abstract-- This paper proposes a state reduction algorithm for incompletely specified FSMs. The algorithm is based on iterative improvements. When the number of compatibles is like...
Hiroyuki Higuchi, Yusuke Matsunaga
FSTTCS
1994
Springer
14 years 19 days ago
Finite-State Strategies in Regular Infinite Games
Abstract. This paper surveys work on the synthesis of reactive programs which implement winning strategies in infinite two-person games. The representation of such games by Muller ...
Wolfgang Thomas
SEC
2003
13 years 10 months ago
From Finite State Machines to Provably Correct Java Card Applets
Abstract This paper presents a systematic approach to developing Java Card applets and/or formal specifications for them, starting from descriptions in the form of finite state m...
Engelbert Hubbers, Martijn Oostdijk, Erik Poll
CONCUR
2004
Springer
14 years 8 days ago
Extended Process Rewrite Systems: Expressiveness and Reachability
Abstract. We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less exp...
Mojmír Kretínský, Vojtech Reh...
KBSE
2008
IEEE
14 years 2 months ago
Inferring Finite-State Models with Temporal Constraints
Finite state machine-based abstractions of software behaviour are popular because they can be used as the basis for a wide range of (semi-) automated verification and validation ...
Neil Walkinshaw, Kirill Bogdanov