Petr Jancar, Antonín Kucera, Richard Mayr  Home/Search
Context Related
| cs.vsb.cz/~jan59/tcs99.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.vsb.cz/~jan59/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that characteristic formulae for nite-state systems up to bisimulation-like equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temporal logic EF. Since EF is a very weak fragment of the modal µ-calculus, model checking with EF is decidable for many more classes of infinite-state systems. This yields a general method for proving decidability of bisimulation-like equivalences between infinite-state processes and finite-state ones. We apply this... (Update)
Cited by: More
Unknown - Jan Car Srba (Correct)
On the Expressive Power of Extended Process Rewrite Systems - Kretinsky, al. (2004) (Correct)
Decidability and Complexity Issues for Infinite-State Processes - Srba (2003) (Correct)
Similar documents (at the sentence level):
11.8%: Deciding Bisimulation-Like Equivalences with Finite-State.. - Jancar, Kucera, Mayr (1998) (Correct)
Active bibliography (related documents): More All
0.6: A Logical Viewpoint on Process-Algebraic Quotients - Anton Ku Cera (Correct)
0.6: Simulation Preorder on Simple Process Algebras - Kucera, Mayr (1999) (Correct)
0.4: Verification on Infinite Structures - Burkart, Caucal, Moller, Steffen (2000) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.5: Bisimilarity of Processes with Finite-state Systems - Jancar, Kucera (1997) (Correct)
0.5: Concept Change Of Pregradual Courses On Mechanical.. - Smutny, Vítecek (2001) (Correct)
0.5: Decidability Questions for Bisimilarity of Petri Nets and Some.. - Jancar (1994) (Correct)
Related documents from co-citation: More All
17: Communication and Concurrency (context) - Milner - 1989
13: Infinite results (context) - Moller - 1996
11: the Regular Structure of Prefix Rewritings (context) - Caucal - 1992
BibTeX entry: (Update)
P. Jancar, A. Kucera, and R. Mayr. Deciding bisimulation-like equivalences with finite-state processes. Tech. Report TUM-I9805, Institut fur Informatik, TUM, Munich, Germany, February 1998. To appear in Proc. ICALP'98, Aalborg, DK, July 1998. http://citeseer.ist.psu.edu/jancar99deciding.html More
@article{ jancar98deciding,
author = "Petr Jancar and Anton{\'\i}n Kucera and Richard Mayr",
title = "Deciding Bisimulation-Like Equivalences with Finite-State Processes",
journal = "Lecture Notes in Computer Science",
volume = "1443",
pages = "200+",
year = "1998",
url = "citeseer.ist.psu.edu/jancar99deciding.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989
151 Reachability analysis of pushdown automata: application to m.. - Bouajjani, Esparza et al.
113 Decidability of bisimulation equivalence for processes gener.. (context) - Baeten, Bergstra et al. - 1993
104 Branching time and abstraction in bisimulation semantics (context) - van Glabbeek, Weijland - 1996
102 Bisimulation equivalence is decidable for all context-free p.. - Christensen, ttel et al. - 1995
67 Pushdown processes: Games and model checking - Walukiewicz - 1996
40 Number 18 in Cambridge Tracts in Theoretical Computer Scienc.. (context) - Baeten, Weijland - 1990
38 Concurrency and automata on innite sequences (context) - Park - 1981
36 Theoretical Computer Science (context) - Muller, Schupp et al. - 1985
32 Decidability of bisimulation equivalence for normed pushdown.. - Stirling - 1998
26 volume 1119 of Lecture Notes in Computer Science (context) - CONCUR' - 1996
26 volume 1243 of Lecture Notes in Computer Science (context) - CONCUR' - 1997
25 The regular viewpoint on PA-processes - Lugiez, Schnoebelen - 1998
23 Information and Computation (context) - Mayr, systems
22 Bisimulation is decidable for all basic parallel processes (context) - Christensen, Hirshfeld et al. - 1993
21 Characteristic formulae for processes with divergence (context) - Steoeen, Ing et al. - 1994
20 Weak bisimulation and model checking for basic parallel proc.. - Mayr - 1996
19 Decidability and Complexity of Model Checking Problems for I.. (context) - Mayr - 1998
17 the regular structure of prex rewriting (context) - Caucal - 1992
13 Model checking PA-processes - Mayr
13 Computation: Finite and Innite Machines (context) - Minsky - 1967
12 Decidability of model checking with the temporal logic EF - Mayr
9 Innite results (context) - Moller
7 Strict lower bounds for model checking BPA - Mayr - 1998
6 Decidability of model checking for innite-state concurrent s.. (context) - Esparza - 1997
6 Checking regular properties of Petri nets (context) - Jan, Moller - 1995
4 Decidability of a temporal logic problem for Petri nets (context) - Jan - 1990
4 Undecidability of bisimilarity for Petri nets and some relat.. - Jan - 1995
3 Simulation preorder on simple process algebras (context) - Ku, Mayr - 1999
3 Decomposable regular languages and the shue operator (context) - Schnoebelen - 1999
2 Deciding niteness of Petri nets up to bisimilarity (context) - Jan, Esparza - 1996
1 Bisimilarity of processes with nite-state systems (context) - Jan, Ku - 1997
1 Weak bisimilarity with innite-state systems can be decided i.. (context) - Ku, Mayr - 1999
1 Comparing expressibility of normed BPA and normed BPP proces.. (context) - ern, et et al. - 1999
1 On eoeective decomposability of sequential behaviours (context) - Ku
1 Petri NetsAn Introduction (context) - Reisig - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.vsb.cz/~jan59/): More
Boundedness of Reset P/T Nets - Dufourd, Jancar, Schnoebelen (1999) (Correct)
Simulation of One-Counter Nets via Colouring - Jancar, Moller (1999) (Correct)
On Monotonic Automata with a Restart Operation - Jancar, Mraz, Platek, Vogel (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC