Pages that link to "Item:Q2760238"
From MaRDI portal
The following pages link to The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes. (Q2760238):
Displaying 50 items.
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- Bisimilar and logically equivalent programs in PDL (Q281144) (← links)
- Comparative trace semantics of time Petri nets (Q300337) (← links)
- ST-structures (Q338620) (← links)
- Two-thirds simulation indexes and modal logic characterization (Q352098) (← links)
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Compositional semantics and behavioural equivalences for reaction systems with restriction (Q403001) (← links)
- On behavioural pseudometrics and closure ordinals (Q456100) (← links)
- Model-checking process equivalences (Q477208) (← links)
- Logics of temporal-epistemic actions (Q516250) (← links)
- Contexts, refinement and determinism (Q541213) (← links)
- Dynamic consistency in process algebra: from paradigm to ACP (Q541685) (← links)
- On the axiomatizability of priority. II (Q549169) (← links)
- Metrics for weighted transition systems: axiomatization and complexity (Q549202) (← links)
- Measuring the confinement of probabilistic systems (Q557887) (← links)
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- Bialgebras for structural operational semantics: an introduction (Q639646) (← links)
- Quantitative analysis of weighted transition systems (Q710680) (← links)
- An operational semantics for object-oriented concepts based on the class hierarchy (Q736789) (← links)
- Introducing extra operations in refinement (Q736913) (← links)
- Relational concurrent refinement. III: Traces, partial relations and automata (Q736917) (← links)
- Ready to preorder: an algebraic and general proof (Q843212) (← links)
- Algebraic simulations (Q844884) (← links)
- Decidability issues for extended ping-pong protocols (Q861694) (← links)
- Fair testing (Q865623) (← links)
- Conjunction on processes: Full abstraction via ready-tree semantics (Q875513) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\) (Q893593) (← links)
- Theory of interaction (Q896903) (← links)
- Product line process theory (Q898612) (← links)
- On finite alphabets and infinite bases (Q924717) (← links)
- Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726) (← links)
- CSP is a retract of CCS (Q960852) (← links)
- Relating fair testing and accordance for service replaceability (Q974133) (← links)
- A precongruence format for should testing preorder (Q974134) (← links)
- On the expressibility of priority (Q975534) (← links)
- Ready to preorder: the case of weak process semantics (Q975539) (← links)
- Component simulation-based substitutivity managing QoS and composition issues (Q988175) (← links)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- Ready simulation for concurrency: it's logical! (Q988555) (← links)
- Revivals, stuckness and the hierarchy of CSP models (Q1007236) (← links)
- (Bi)simulations up-to characterise process semantics (Q1012122) (← links)
- Bialgebraic methods and modal logic in structural operational semantics (Q1012126) (← links)
- Hardness of equivalence checking for composed finite-state systems (Q1015390) (← links)
- Relational concurrent refinement. II: Internal operations and outputs (Q1019018) (← links)
- Process algebra with guards: Combining hoare logic with process algebra (Q1329197) (← links)
- Linear time and branching time semantics for recursion with merge (Q1348527) (← links)
- The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
- Equivalence of recursive specifications in process algebra (Q1607118) (← links)
- Automated verification of automata communicating via FIFO and bag buffers (Q1650866) (← links)