Search Sciweavers | Sciweavers

305 search results - page 2 / 61

» Decidability of Split Equivalence

click to vote

ICALP
1998
Springer

110views Programming Languages» more ICALP 1998»

Deciding Bisimulation-Like Equivalences with Finite-State Processes

13 years 9 months ago

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 »

click to vote

CONCUR
1991
Springer

105views Distributed And Parallel Com...» more CONCUR 1991»

A Tool Set for deciding Behavioral Equivalences

13 years 8 months ago

Download ftp.inrialpes.fr

This paper deals with veriﬁcation methods based on equivalence relations between labeled transition systems. More precisely, we are concerned by two practical needs: how to eﬃ...

Jean-Claude Fernandez, Laurent Mounier

claim paper

Read More »

click to vote

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

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 »

click to vote

FSTTCS
2005
Springer

102views Software Engineering» more FSTTCS 2005»

The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable

13 years 10 months ago