Sciweavers

    14 search results - page 1 / 3
    » Bisimulation Equivalence is Decidable for One-Counter Proces...
    Sort
    View
    ICALP
    1997
    Springer
    84views Programming Languages» more  ICALP 1997»
    Bisimulation Equivalence is Decidable for One-Counter Processes
    13 years 9 months ago
    Bisimulation Equivalence is Decidable for One-Counter Processes
    Download  www.fi.muni.cz
    Petr Jancar
    claim paper
    Read More »
    TCS
    1998
    106views Theoretical Computer Science» more  TCS 1998»
    Decidability of Bisimulation Equivalence for Normed Pushdown Processes
    13 years 4 months ago
    Decidability of Bisimulation Equivalence for Normed Pushdown Processes
    Download  www.lfcs.inf.ed.ac.uk
    We prove that bisimulation equivalence is decidable for normed pushdown processes.
    Colin Stirling
    claim paper
    Read More »
    ICALP
    1998
    Springer
    110views Programming Languages» more  ICALP 1998»
    Deciding Bisimulation-Like Equivalences with Finite-State Processes
    13 years 9 months ago
    Deciding Bisimulation-Like Equivalences with Finite-State Processes
    Download  www.fi.muni.cz
    We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
    Petr Jancar, Antonín Kucera, Richard Mayr
    claim paper
    Read More »
    PARLE
    1987
    144views Distributed And Parallel Com...» more  PARLE 1987»
    Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
    13 years 8 months ago
    Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
    Download  web.mac.com
    A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
    Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
    claim paper
    Read More »
    CONCUR
    1992
    Springer
    101views Distributed And Parallel Com...» more  CONCUR 1992»
    Bisimulation Equivalence is Decidable for all Context-Free Processes
    13 years 9 months ago
    Bisimulation Equivalence is Decidable for all Context-Free Processes
    Download  homepages.inf.ed.ac.uk
    Søren Christensen, Hans Hüttel, Colin ...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.