Pages that link to "Item:Q4371679"
From MaRDI portal
The following pages link to Branching time and abstraction in bisimulation semantics (Q4371679):
Displaying 50 items.
- Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions (Q288785) (← links)
- Formal modelling and verification of GALS systems using GRL and CADP (Q315303) (← links)
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Reactive Turing machines (Q393091) (← links)
- External equality and absolute equality coincide in finite CCS and \(\pi\) calculus without summation (Q407482) (← links)
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity (Q418189) (← links)
- On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi (Q481103) (← links)
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- Confluence reduction for Markov automata (Q507382) (← links)
- Computing maximal weak and other bisimulations (Q510897) (← links)
- A general account of coinduction up-to (Q523132) (← links)
- Soundness of workflow nets: classification, decidability, and analysis (Q539433) (← links)
- Simulation refinement for concurrency verification (Q541209) (← links)
- Dynamic consistency in process algebra: from paradigm to ACP (Q541685) (← links)
- On cool congruence formats for weak bisimulations (Q549196) (← links)
- Application of static analyses for state-space reduction to the microcontroller binary code (Q617924) (← links)
- Extensional Petri net (Q667521) (← links)
- Infinite normal forms for non-linear term rewriting systems (Q672235) (← links)
- Structural operational semantics for weak bisimulations (Q673123) (← links)
- Deciding observational congruence of finite-state CCS expressions by rewriting (Q673974) (← links)
- A formal verification technique for behavioural model-to-model transformations (Q682361) (← links)
- Refinement of actions in event structures and causal trees (Q688717) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Encapsulating deontic and branching time specifications (Q714879) (← links)
- Verification of reactive systems via instantiation of parameterised Boolean equation systems (Q716322) (← links)
- Game-theoretic simulation checking tool (Q764005) (← links)
- Branching bisimulation congruence for probabilistic systems (Q764289) (← links)
- Raiders of the lost equivalence: probabilistic branching bisimilarity (Q783681) (← links)
- Translating Java for multiple model checkers: The Bandera back-end (Q816196) (← links)
- Model independent approach to probabilistic models (Q831149) (← links)
- Cones and foci: A mechanical framework for protocol verification (Q853730) (← links)
- Preferential choice and coordination conditions (Q864506) (← links)
- Unique parallel decomposition in branching and weak bisimulation semantics (Q896916) (← links)
- Towards a process calculus for REST: current state of the art (Q902704) (← links)
- Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726) (← links)
- Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
- On the expressiveness of interaction (Q960859) (← links)
- Probabilistic weak simulation is decidable in polynomial time (Q1029062) (← links)
- Conduché property and tree-based categories (Q1040596) (← links)
- The compression structure of a process (Q1044743) (← links)
- Observational structures and their logic (Q1190494) (← links)
- Process calculus based upon evaluation to committed form (Q1276241) (← links)
- When is partial trace equivalence adequate? (Q1333407) (← links)
- Focus points and convergent process operators: A proof strategy for protocol verification (Q1349249) (← links)
- Branching bisimilarity is an equivalence indeed! (Q1350620) (← links)
- A general conservative extension theorem in process algebras with inequalities (Q1391791) (← links)
- Process algebra with propositional signals (Q1391792) (← links)
- Process algebra with language matching (Q1391794) (← links)
- Two finite specifications of a queue (Q1391797) (← links)
- The cones and foci proof technique for timed transition systems (Q1607115) (← links)
