| Index Entry | Section |
|
Q | | |
| quantification | 1.6 Operations on Multi-Sets |
| quantification, expanding | 3.1.2 Expanding Quantifications |
| query language | 2.2.2 The Query Language |
| query language | A.3 The Query Language |
| queue | 1.4.3.4 Buffer (Queue or Stack) |
| queues | 1.5.6 Buffers |
|
R | | |
| random behavior | 1.8 Non-Determinism in Transitions |
| reachability analysis | 2. Reachability Analysis with Maria |
| reachability graph, examining | 2.2 The Maria Shell |
| reachability graph, file format | B. The Graph Files |
| reachability graph, generating | 2.1 Invoking Maria |
| Readline | 2.2.1.1 Name Completion |
| redundant places | 1.3.3 Place Definition: `place' |
| reject | 1.3.6.1 Verifying Safety Properties |
| release | 1.7 Temporal Logic |
| reserved words | 1.2.3.1 Reserved Words |
|
S | | |
| scoping, identifiers | 1.9 Scoping of Identifiers |
| sets | 1.6 Operations on Multi-Sets |
| shadowing declarations | 1.9 Scoping of Identifiers |
| show, query language | 2.2.2.8 Displaying Markings |
| simulating | 2.2.2.11 Listing Successor Nodes |
| stack | 1.4.3.4 Buffer (Queue or Stack) |
| stacks | 1.5.6 Buffers |
| state propositions | 1.3.6.3 Specifying State Propositions for LSTS Output |
| state space explosion, avoiding | 1.4.4 Constraints |
| stats, query language | 2.2.2.18 Miscellanous Commands |
| strong, query language | 2.2.2.16 Strongly Connected Components |
| strongly connected components | 2.2.2.16 Strongly Connected Components |
| strongly_fair | 1.3.4 Transition Definition: `trans' |
| strongly_fair | 1.3.6.2 Defining Fairness Constraints |
| struct | 1.4.3.1 Structure |
| subnet | 1.3.5 Defining Subnets for Modular State Space Exploration |
| subnet, query language | 2.2.2.10 Selecting the Active Subnet |
| subnets | 1.3.5 Defining Subnets for Modular State Space Exploration |
| subset | 1.6 Operations on Multi-Sets |
| subset, selection | 1.6 Operations on Multi-Sets |
| succ, query language | 2.2.2.11 Listing Successor Nodes |
| successor and predecessor | 1.5.2.2 Successor and Predecessor |
| syntax highlighting | 2.3.1 Installing the Petri Net mode |
| syntax highlighting | 2.3.2 Syntax Highlighting |
|
T | | |
| temporal operators | 1.7 Temporal Logic |
| terminal component | 2.2.2.16 Strongly Connected Components |
| terminal, query language | 2.2.2.16 Strongly Connected Components |
| time, query language | 2.2.2.18 Miscellanous Commands |
| tokens | 1.3.3 Place Definition: `place' |
| tokens, formal and concrete | 3.1.3 Matching Concrete and Formal Tokens |
| trans | 1.3.4 Transition Definition: `trans' |
| trans, query language | 2.2.2.14 Anonymous Transitions |
| transitions, enabled | 1.3.4 Transition Definition: `trans' |
| transitions, firing | 1.3.4 Transition Definition: `trans' |
| transitions, instance analysis | 3.1.5 Transition Instance Analysis |
| translator, query language | 2.2.2.18 Miscellanous Commands |
| trivial component | 2.2.2.16 Strongly Connected Components |
| true | A.4.1 Literals |
| typedef | 1.3.1 Type Definitions: `typedef' |
|
U | | |
| undefined | A.4.1 Literals |
| unfold, query language | 2.2.2.3 Unfolding a Model |
| unification | 3.1 The Unification Algorithm |
| unification stack | 3.1.5 Transition Instance Analysis |
| union | 1.6 Operations on Multi-Sets |
| union, data type | 1.4.3.2 Union |
| unions, active component | 1.5.4 Unions |
| unsigned | 1.4.2.1 Integer Types |
| until | 1.7 Temporal Logic |
|
V | | |
| variable declarations | 1.3.4 Transition Definition: `trans' |
| variables | 1.5.1.2 Variables |
| variables, output | 1.8 Non-Determinism in Transitions |
| visual, query language | 2.2.2.2 Displaying a Model |
| visual, query language | 2.2.2.5 Exporting the Reachability Graph |
| visual, query language | 2.2.2.6 Exhaustive Analysis |
| visual, query language | 2.2.2.7 Evaluating Expressions and Formulae |
| visual, query language | 2.2.2.8 Displaying Markings |
| visual, query language | 2.2.2.11 Listing Successor Nodes |
| visual, query language | 2.2.2.12 Listing Predecessor Nodes |
| visual, query language | 2.2.2.16 Strongly Connected Components |
| visual, query language | 2.2.2.17 Shortest Paths |
| visual, query language | 2.2.4 Visualizing Graphs and Paths |
|
W | | |
| weakly_fair | 1.3.4 Transition Definition: `trans' |
| weakly_fair | 1.3.6.2 Defining Fairness Constraints |
|