On the power of labels in transition systems

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

Volumn 2154, Issue , 2001, Pages 277-291

  Srba, Jiří ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; PETRI NETS; TEMPORAL LOGIC;

BISIMILARITY; LABELLED TRANSITION SYSTEMS; MODEL CHECKING PROBLEM; MU-CALCULUS; PUSH-DOWN AUTOMATA; SATISFIABILITY; TRANSITION SYSTEM; UNDECIDABILITY;

MODEL CHECKING;

EID: 84944060726     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_19     Document Type: Conference Paper

References (21)

1. [BAMP83] M. Ben-Ari, Z. Manna, and A. Pnueli. The temporal logic of branching time. Acta Informatica, 20(3):207–226, 1983.
2. [BE97] O. Burkart and J. Esparza. More infinite results. Bulletin of the European Association for Theoretical Computer Science, 62:138–159, June 1997. Columns: Concurrency.
3. [CE81] E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Logic of Programs Workshop, volume 131 of LNCS, pages 52–71. Springer-Verlag, 1981.
4. [CES86] E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach. ACM Transactions on Programming Languages and Systems, 8(2):244–263, 1986.
5. [EK95] J. Esparza and A. Kiehn. On the model checking problem for branching time logics and basic parallel processes. In International Conference on Computer-Aided Verification (CAV’95), volume 939 of LNCS, pages 353–366, 1995.
6. J. Esparza. Decidability of model-checking for infinite-state concurrent systems. Acta Informatica, 34:85–107, 1997.
7. [HM85] M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computing Machinery, 32(1):137–161, 1985.
8. P. Jancar. Undecidability of bisimilarity for Petri nets and some related problems. Theoretical Computer Science, 148(2):281–301, 1995.
9. [JKM98] P. Jancar, A. Kucera, and R. Mayr. Deciding bisimulation-like equivalences with finite-state processes. In Proceedings of the Annual International Colloquium on Automata, Languages and Programming (ICALP’98), volume 1443 of LNCS. Springer-Verlag, 1998.
10. [JM95] P. Jancar and F. Moller. Checking regular properties of Petri nets. In Proceedings of CONCUR’95, volume 962 of LNCS, pages 348–362. Springer- Verlag, 1995.
11. R. Mayr. Strict lower bounds for model checking BPA. In Proceedings of the MFCS’98 Workshop on Concurrency, volume 18 of ENTCS. Springer- Verlag, 1998.
12. R. Mayr. On the complexity of bisimulation problems for pushdown automata. In IFIP International Conference on Theoretical Computer Science (IFIP TCS’2000), volume 1872 of LNCS. Springer-Verlag, 2000.
13. F. Moller. Infinite results. In Proceedings of CONCUR’96, volume 1119 of LNCS, pages 195–216. Springer-Verlag, 1996.
14. J.L. Peterson. Petri Net Theoryand the Modelling of Systems. Prentice- Hall, 1981.
15. G. Senizergues. Decidability of bisimulation equivalence for equational graphs of finite out-degree. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science(FOCS-98), pages 120–129. IEEE Computer Society, 1998.
16. J. Srba. On the power of labels in transition systems. Technical Report RS-01-19, BRICS Research Series, 2001.
17. C. Stirling. Local model checking games. In Proceedings of the 6th International Conference on ConcurrencyThe ory(CONCUR’95), volume 962 of LNCS, pages 1–11. Springer-Verlag, 1995.
18. W. Thomas. On the Ehrenfeucht-Fraisse game in theoretical computer science (extended abstract). In Proceedings of the 4th International Joint Conference CAAP/FASE, Theoryand Practice of Software Development (TAPSOFT’93), volume 668 of LNCS, pages 559–568. Springer-Verlag, 1993.
19. W. Vogler. Modular construction and partial order semantics of Petri nets, volume 625 of LNCS. Springer-Verlag, 1992.
20. I. Walukiewicz. Pushdown processes: Games and model checking. In International Conference on Computer-Aided Verification (CAV’96), volume 1102 of LNCS, pages 62–74, 1996. To appear in Information and Computation.
21. I. Walukiewicz. Model checking CTL properties of pushdown systems. In Proceedings Foundations of Software Technologyand Theoretical Computer Science (FSTTCS’00), volume 1974 of LNCS, pages 127–138. Springer-Verlag, 2000.