On the complexity of the linear-time µ-calculus for petri nets

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

Volumn 1248, Issue , 1997, Pages 102-116

  Habermehl, Peter ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATIONAL COMPLEXITY; MODEL CHECKING; PETRI NETS;

DOUBLE EXPONENTIAL; LINEAR TIME; LINEAR TIME TEMPORAL LOGIC; POLYNOMIAL SPACE; SPACE COMPLEXITY;

TEMPORAL LOGIC;

EID: 84958978941     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63139-9_32     Document Type: Conference Paper

References (19)

1. P. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Information and Computation, 127:91-101, 1996.
2. I. Borosh and L. Treybis. Bounds on positive integral solutions of linear Diophantine equations. Proc. Amer. Math Soc., 55:299-304, 1976.
3. Spren Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, University of Edinburgh, 1993.
4. M. Dam. Fixed points of Büchi automata. In R. Shyamasundar, editor, Foundations of Software Technology and Theoretical Computer Science, volume 652 of Lecture Notes in Computer Science, pages 39-50. Springer-Verlag, 1992.
5. J. Esparza. On the decidability of model checking for several mu-calculi and petri nets. In CAAP: Colloquium on Trees in Algebra and Programming. LNCS 787, Springer-Verlag, 1994.
6. J. Esparza. More infinite results. In Steffen and Margaria, editors, Infinity: International Workshop on Verification of Infinite State Systems. Tech. Report MIP-9614, Univ. Passau, 1996.
7. J. Esparza and A. Kiehn. On the model checking problem for branching time logics and basic parallel processes. In CAV’95. LNCS 939, 1995.
8. R. Lipton. The reachability problem requires exponential space. Technical Report 62, Department of Computer Science, Yale University, January 1976.
9. Faron Moller. Infinite results. In CONCUR: 7th International Conference on Concurrency Theory, volume 1119. LNCS, Springer-Verlag, 1996.
10. D. Park. Concurrency and Automata on Infinite Sequences. In 5th GI-Conference on Theoretical Computer Science. 1981. LNCS 104.
11. A. Pnueli. The Temporal Logic of Programs. In FOCS’77. IEEE, 1977.
12. Charles Rackoff. The covering and boundedness problems for vector addition systems. Theoretical Computer Science, 6(2):223-231, April 1978.
13. Louis E. Rosier and Hsu-Chun Yen. A multiparameter analysis of the boundedness problem for vector addition systems. Journal of Computer and System Sciences, 32(1):105-135, February 1986.
14. S. Safra. On the complexity of ω-automata. In 29th Annual Symposium on Foundations of Computer Science, pages 319-327, White Plains, New York, 24-26 October 1988. IEEE.
15. W. J. Savitch. Relational between nondeterministic and deterministic tape complexity. Journal of Computer and System Sciences, 4:177-192, 1970.
16. M. Y. Vardi. A temporal fixpoint calculus. In ACM-SIGPLAN ACM-SIGACT, editor, Conference Record of the 15th Annual ACM Symposium on Principels of Programming Languages (POPL '88), pages 250-259, San Diego, CA, USA, January 1988. ACM Press.
17. M. Y. Vardi. An automata-theoretic approach to linear temporal logic (banff’94). Lecture Notes in Computer Science, 1043, 1996.
18. Moshe Y. Vardi and Pierre Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, 15 November 1994.
19. P. Wolper. Temporal Logic Can Be More Expressive. Information and Control, 56, 1983.