Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

BIRTHDAY
2008
Springer

favoriteEmaildiscussreport

141views Applied Computing» more BIRTHDAY 2008»

Some Results on the Expressive Power and Complexity of LSCs

13 years 6 months ago

Some Results on the Expressive Power and Complexity of LSCs

Download www.wisdom.weizmann.ac.il

Abstract. We survey some of the main results regarding the complexity and expressive power of Live Sequence Charts (LSCs). We first describe the two main semantics given to LSCs: a trace-based semantics and an operational semantics. The expressive power of the language is then examined by describing translations into various temporal logics. Some limitations of the language are also discussed. Finally, we survey complexity results, mainly due to Bontemps and Schobbens, regarding the use of LSCs for model checking, execution, and synthesis.

David Harel, Shahar Maoz, Itai Segall

Real-time Traffic

Applied Computing | BIRTHDAY 2008 | Expressive Power | Live Sequence Charts | Main Semantics |

claim paper

Related Content

» Some Methodological Observations Resulting from Experience Using LSCs and the PlayInPlayOu...

» Some Recent Results in Metric Temporal Logic

» Linear Time Logics Around PSL Complexity Expressiveness and a Little Bit of Succinctness

» A Guided Tour through Some Extensions of the Event Calculus

» On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Mat...

» Some theoretical results about the computation time of evolutionary algorithms

» Linear Constraint Query Languages Expressive Power and Complexity

» Tight Bounds on the Descriptional Complexity of Regular Expressions

» The expressive power of the shuffle product

Post Info
More Details (n/a)

Added	12 Oct 2010
Updated	12 Oct 2010
Type	Conference
Year	2008
Where	BIRTHDAY
Authors	David Harel, Shahar Maoz, Itai Segall

Comments (0)