Containment of regular languages in non-regular timing diagram languages is decidable
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 155-166
- https://doi.org/10.1007/3-540-63166-6_17
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Parametric real-time reasoningPublished by Association for Computing Machinery (ACM) ,1993
- Integrating Behavior and Timing in Executable SpecificationsPublished by Elsevier ,1993
- New decidability results concerning two-way counter machines and applicationsPublished by Springer Nature ,1993
- Consistency and satisfiability of waveform timing specificationsNetworks, 1991
- Reversal-Bounded Multicounter Machines and Their Decision ProblemsJournal of the ACM, 1978