Deciding properties of integral relational automata
Author:
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 35-46
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Undecidable verification problems for programs with unreliable channels1994
- Decidability questions for bisimilarity of Petri nets and some related problemsLecture Notes in Computer Science, 1994
- Bisimulation equivalence is decidable for basic parallel processes1993
- Decidability of bisimulation equivalences for parallel timer processes1993
- The complementation problem for Büchi automata with applications to temporal logicTheoretical Computer Science, 1987
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- An Algorithm for the General Petri Net Reachability ProblemSIAM Journal on Computing, 1984
- "Sometimes" and "not never" revisited1983
- Decidability of reachability in vector addition systems (Preliminary Version)1982