Pages that link to "Item:Q685387"
From MaRDI portal
The following pages link to Transition system specifications with negative premises (Q685387):
Displaying 50 items.
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity (Q418189) (← links)
- Rule formats for determinism and idempotence (Q433348) (← links)
- Some undecidable properties of SOS specifications (Q511941) (← links)
- Structural operational semantics for weak bisimulations (Q673123) (← links)
- A syntactic commutativity format for SOS (Q835035) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- A precongruence format for should testing preorder (Q974134) (← links)
- Semantics and expressiveness of ordered SOS (Q1012119) (← links)
- A process algebraic view of Linda coordination primitives (Q1127512) (← links)
- A conservative look at operational semantics with variable binding (Q1273877) (← links)
- A general conservative extension theorem in process algebras with inequalities (Q1391791) (← links)
- An alternative formulation of operational conservativity with binding terms. (Q1400151) (← links)
- Algebraic theory of probabilistic and nondeterministic processes. (Q1400156) (← links)
- Comparing three semantics for Linda-like languages (Q1575148) (← links)
- Finite axiom systems for testing preorder and De Simone process languages (Q1575273) (← links)
- Language preorder as a precongruence (Q1575654) (← links)
- The theory of interactive generalized semi-Markov processes (Q1603705) (← links)
- Process algebra and conditional composition (Q1607116) (← links)
- Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity (Q1680509) (← links)
- Discrete time generative-reactive probabilistic processes with different advancing speeds (Q1853593) (← links)
- A comparison of Statecharts step semantics (Q1853596) (← links)
- On the expressiveness of Linda coordination primitives. (Q1854324) (← links)
- Absolute versus relative time in process algebras. (Q1854325) (← links)
- Ordered SOS process languages for branching and eager bisimulations (Q1854563) (← links)
- The meaning of negative premises in transition system specifications. II (Q1878713) (← links)
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation (Q1878718) (← links)
- A format for semantic equivalence comparison (Q1884897) (← links)
- Rooted branching bisimulation as a congruence (Q1975965) (← links)
- Probabilistic divide \& congruence: branching bisimilarity (Q2007735) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- Bialgebraic foundations for the operational semantics of string diagrams (Q2051792) (← links)
- On the axiomatisability of priority. III: Priority strikes again (Q2193294) (← links)
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence (Q2272990) (← links)
- Compositionality of Hennessy-Milner logic by structural operational semantics (Q2368979) (← links)
- A unified rule format for bounded nondeterminism in SOS with terms as labels (Q2403821) (← links)
- Reduction semantics in Markovian process algebra (Q2413025) (← links)
- A process algebraic view of shared dataspace coordination (Q2474048) (← links)
- Notions of bisimulation and congruence formats for SOS with data (Q2486401) (← links)
- A general SOS theory for the specification of probabilistic transition systems (Q2629851) (← links)
- Compositional equivalences based on open pNets (Q2683032) (← links)
- Reactive bisimulation semantics for a process algebra with timeouts (Q2687033) (← links)
- Structural Operational Semantics with First-Order Logic (Q2810690) (← links)
- A Congruence Rule Format with Universal Quantification (Q2871833) (← links)
- (Q3385651) (← links)
- A Pre-congruence Format for XY-simulation (Q3455865) (← links)
- Branching vs. Linear Time: Semantical Perspective (Q3510781) (← links)
- Process algebra with four-valued logic (Q4443411) (← links)
- Sequent calculi for default and autoepistemic logics (Q4645232) (← links)
- (Q5013870) (← links)
- (Q5089269) (← links)
