Sciweavers

    ENTCS
    2006
    173views more  ENTCS 2006»
    Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
    15 years 3 months ago
    Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
    Download  seshome.informatik.uni-oldenburg.de
    Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
    Tobe Toben, Bernd Westphal
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.