On projective and separable properties
From MaRDI portal
Publication:1389766
DOI10.1016/S0304-3975(96)00225-3zbMath0893.68090MaRDI QIDQ1389766
Publication date: 30 June 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stutter-invariant temporal properties are expressible without the next-time operator
- Event fairness and non-interleaving concurrency
- A syntactic congruence for rational \(\omega\)-languages
- Appraising fairness in languages for distributed programming
- Combinatorics on traces
- Verification of distributed programs using representative interleaving sequences
- Complexity of some problems in Petri nets
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages
- A partial approach to model checking
- Rational and recognizable complex trace languages
- Interleaving set temporal logic
- Linear Automaton Transformations
- Temporal logic can be more expressive
- The complexity of propositional linear temporal logics
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
This page was built for publication: On projective and separable properties
