Extended process rewrite systems: Expressiveness and reachability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3170, Issue , 2004, Pages 355-370

  Křetínský, Mojmír ^a   Řehák, Vojtěch ^a   Strejček, Jan ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS;

BISIMULATION EQUIVALENCES; EXPRESSIVE POWER; FINITE STATE CONTROL; FINITE-STATE UNITS; PROCESS REWRITE SYSTEMS; REACHABILITY; REACHABILITY PROBLEM;

EQUIVALENCE CLASSES;

EID: 35048819966     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28644-8_23     Document Type: Article

References (24)

1. [BCMS01] O. Burkart, D. Caucal, F. Moller, and B. Steffen. Verification on infinite structures. In Handbook of Process Algebra, pages 545-623. Elsevier, 2001.
2. [BEH95] A. Bouajjani, R. Echahed, and P. Habermehl. On the verification problem of nonregular properties for nonregular processes. In LICS'95. IEEE, 1995.
3. [BET03] A. Bouajjani, J. Esparza, and T. Touili. A generic approach to the static analysis of concurrent programs with procedures. International Journal on Foundations of Computer Science, 14(4):551-582, 2003.
4. [BT03] A. Bouajjani and T. Touili. Reachability Analysis of Process Rewrite Systems. In Proc. of FST&TCS-2003, volume 2914 of LNCS, pages 74-87. Springer, 2003.
5. [Büc64] J. R. Büchi. Regular canonical systems. Arch. Math. Logik u. Grundlagenforschung, 6:91-111, 1964.
6. [Cau92] D. Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science, 106:61-86, 1992.
7. [DAC98] M. B. Dwyer, G. S. Avrunin, and J. C. Corbett. Property specification patterns for finite-state verification. In Mark Ardis, editor, Proc. 2nd Workshop on Formal Methods in Software Practice (FMSP-98), pages 7-15, New York, 1998. ACM Press.
8. [DY83] D. Dolev and A. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
9. [Esp02] J. Esparza. Grammars as processes. In Formal and Natural Computing, volume 2300 of LNCS. Springer, 2002.
10. [HS04] H. Hüttel and J. Srba. Recursion vs. replication in simple cryptographic protocols. Submitted for publication, 2004.
11. [Jan95] P. Jančar. High Undecidability of Weak Bisimilarity for Petri Nets. In Proc. of TAPSOFT, volume 915 of LNCS, pages 349-363. Springer, 1995.
12. [JKM01] P. Jančar, A. Kučera, and R. Mayr. Deciding bisimulation-like equivalences with finite-state processes. Theoretical Computer Science, 258:409-433, 2001.
13. [KŘS03] M. Křetínský, V. Řehák, and J. Strejček. Process Rewrite Systems with Weak Finite-State Unit. Technical Report FIMU-RS-2003-05, Masaryk University Brno, 2003. to appear in ENTCS as Proc. of INFINITY 03.
14. [LS98] D. Lugiez and Ph. Schnoebelen. The regular viewpoint on PA-processes. In Proc. of CONCUR'98, volume 1466 of LNCS, pages 50-66, 1998.
15. [May81] E. W. Mayr. An algorithm for the general Petri net reachability problem. In Proc. of 13th Symp. on Theory of Computing, pages 238-246. ACM, 1981.
16. [May00] R. Mayr. Process rewrite systems. Information and Computation, 156(1):264-286, 2000.
17. [Mil89] R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
18. [Mol96] F. Moller. Infinite results. In Proc. of CONCUR'96, volume 1119 of LNCS, pages 195-216. Springer, 1996.
19. [Mol98] F. Moller. Pushdown Automata, Multiset Automata and Petri Nets, MFCS Workshop on concurrency. Electronic Notes in Theoretical Computer Science, 18, 1998.
20. [MSS92] D. Muller, A. Saoudi, and P. Schupp. Alternating automata, the weak monadic theory of trees and its complexity. Theoret. Computer Science, 97(1-2):233-244, 1992.
21. [Pet81] J. L. Peterson. Petri Net Theory and the Modelling of Systems. Prentice-Hall, 1981.
22. [SR90] V. A. Saraswat and M. Rinard. Concurrent constraint programming. In Proc. of 17th POPL, pages 232-245. ACM Press, 1990.
23. [Srb02] J. Srba. Roadmap of infinite results. EATCS Bulletin, (78):163-175, 2002. http://www.brics.dk/~srba/roadmap/.
24. [Str02] J. Strejček. Rewrite systems with constraints, EXPRESS'01. Electronic Notes in Theoretical Computer Science, 52, 2002.