Visual Exploration of Generation Algorithms for Finite Automata on the Web . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 327 Stephan Diehl, Andreas Kerren, Torsten Weller Treebag . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 329 Frank Drewes, Renate Klempien-Hinrichs Word Random Access Compression . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 331 Jiř́ı Dvorský, Václav Snášel Extended Sequentialization of Transducers . . . . . . . . . . . . . . . . . . . . . . . . . . . 333 Tamás Gaál Lessons from INR in the Specification of Transductions . . . . . . . . . . . . . . . . . 335 J. Howard Johnson Part-of-Speech Tagging with Two Sequential Transducers . . . . . . . . . . . . . . . 337 André Kempe Solving Complex Problems Efficiently with Adaptive Automata . . . . . . . . . . 340 João José Neto Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 343 Synthesizing State-Based Object Systems from LSC Specifications David Harel and Hillel Kugler Department of Computer Science and Applied Mathematics The Weizmann Institute of Science, Rehovot, Israel {harel,kugler}@wisdom.weizmann.ac.il Abstract. Live sequence charts (LSCs) have been defined recently as an extension of message sequence charts (MSCs; or their UML variant, sequence diagrams) for rich inter-object specification. One of the main additions is the notion of universal charts and hot, mandatory behavior, which, among other things, enables one to specify forbidden scenarios. LSCs are thus essentially as expressive as statecharts. This paper deals with synthesis, which is the problem of deciding, given an LSC specification, if there exists a satisfying object system and, if so, to synthesize one automatically. The synthesis problem is crucial in the development of complex systems, since sequence diagrams serve as the manifestation of use cases — whether used formally or informally — and if synthesizable they could lead directly to implementation. Synthesis is considerably harder for LSCs than for MSCs, and we tackle it by defining consistency, showing that an entire LSC specification is consistent iff it is satisfiable by a state-based object system, and then synthesizing a satisfying system as a collection of finite state machines or statecharts. Live sequence charts (LSCs) have been defined recently as an extension of message sequence charts (MSCs; or their UML variant, sequence diagrams) for rich inter-object specification. One of the main additions is the notion of universal charts and hot, mandatory behavior, which, among other things, enables one to specify forbidden scenarios. LSCs are thus essentially as expressive as statecharts. This paper deals with synthesis, which is the problem of deciding, given an LSC specification, if there exists a satisfying object system and, if so, to synthesize one automatically. The synthesis problem is crucial in the development of complex systems, since sequence diagrams serve as the manifestation of use cases — whether used formally or informally — and if synthesizable they could lead directly to implementation. Synthesis is considerably harder for LSCs than for MSCs, and we tackle it by defining consistency, showing that an entire LSC specification is consistent iff it is satisfiable by a state-based object system, and then synthesizing a satisfying system as a collection of finite state machines or statecharts.
[1]
Frank Morawietz,et al.
The MSO Logic-Automaton Connection in Linguistics
,
1997,
LACL.
[2]
Nils Klarlund,et al.
A Theory of Restrictions for Logics and Automata
,
1999,
CAV.
[3]
Nils Klarlund,et al.
MONA: Monadic Second-Order Logic in Practice
,
1995
.
[4]
Nils Klarlund,et al.
Automatic verification of pointer programs using monadic second-order logic
,
1997,
PLDI '97.
[5]
Mamoun Filali,et al.
FMona: A Tool for Expressing Validation Techniques over Infinite State Systems
,
2000,
TACAS.
[6]
Anders Sandholm,et al.
A Case Study on Using Automata in Control Synthesis
,
2000,
FASE.
[7]
Don E. Ross,et al.
Heuristics to compute variable orderings for efficient manipulation of ordered binary decision diagrams
,
1991,
28th ACM/IEEE Design Automation Conference.
[8]
Mogens Nielsen,et al.
Automated logical verification based on trace abstractions
,
1995,
PODC '96.
[9]
Wolfgang Thomas,et al.
Automata on Infinite Objects
,
1991,
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[10]
C. C. Elgot.
Decision problems of finite automata design and related arithmetics
,
1961
.
[11]
Randal E. Bryant,et al.
Graph-Based Algorithms for Boolean Function Manipulation
,
1986,
IEEE Transactions on Computers.
[12]
Michael I. Schwartzbach,et al.
Compile-Time Debugging of C Programs Working on Trees
,
2000,
ESOP.
[13]
Anders Sandholm,et al.
Distributed Safety Controllers for Web Services
,
1997,
FASE.
[14]
Nils Klarlund,et al.
Algorithms for Guided Tree Automata
,
1996,
Workshop on Implementing Automata.
[15]
Nils Klarlund,et al.
Yakyak: parsing with logical side constraints
,
1999,
Developments in Language Theory.
[16]
Nils Klarlund,et al.
Hardware Verification using Monadic Second-Order Logic
,
1995,
CAV.
[17]
Albert R. Meyer,et al.
WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE
,
1973
.
[18]
Nils Klarlund,et al.
BDD Algortihms and Cache Misses
,
1996
.
[19]
J. Büchi.
Weak Second‐Order Arithmetic and Finite Automata
,
1960
.
[20]
Nils Klarlund,et al.
Verification of a Sliding Window Protocol Using IOA and MONA
,
2000,
FORTE.
[21]
Thomas R. Shiple,et al.
A Comparison of Presburger Engines for EFSM Reachability
,
1998,
CAV.
[22]
Nils Klarlund,et al.
Automata based symbolic reasoning in hardware verification
,
1998,
FM-Trends 1998.
[23]
Nils Klarlund,et al.
MONA 1.x: New Techniques for WS1S and WS2S
,
1998,
CAV.
[24]
J. R. Büchi.
On a Decision Method in Restricted Second Order Arithmetic
,
1990
.