Pages that link to "Item:Q1067408"
From MaRDI portal
The following pages link to Algebra of communicating processes with abstraction (Q1067408):
Displaying 50 items.
- Using integer programming to verify general safety and liveness properties (Q1346653) (← links)
- On the operational semantics of nondeterminism and divergence (Q1350504) (← links)
- A polynomial algorithm for deciding bisimilarity of normed context-free processes (Q1351456) (← links)
- Actors, actions, and initiative in normative system specification (Q1353968) (← links)
- An equational axiomatization for multi-exit iteration (Q1369097) (← links)
- A complete axiomatization of finite-state ACSR processes (Q1376418) (← links)
- A process algebra of communicating shared resources with dense time and priorities (Q1389685) (← links)
- Essential transitions to bisimulation equivalences (Q1391753) (← links)
- The algebra of communicating processes with empty process (Q1391788) (← links)
- A general conservative extension theorem in process algebras with inequalities (Q1391791) (← links)
- Termination modulo equations by abstract commutation with an application to iteration (Q1391793) (← links)
- Process algebra with language matching (Q1391794) (← links)
- Two finite specifications of a queue (Q1391797) (← links)
- Finite axiom systems for testing preorder and De Simone process languages (Q1575273) (← links)
- Dynamic connectors for concurrency (Q1603689) (← links)
- Bisimulation indexes and their applications (Q1606119) (← links)
- Additive models of probabilistic processes (Q1607220) (← links)
- A formal approach to object-oriented software engineering (Q1608926) (← links)
- Rule formats for distributivity (Q1758150) (← links)
- The quest for minimal quotients for probabilistic and Markov automata (Q1784955) (← links)
- Modular specification of process algebras (Q1802074) (← links)
- Fixed points in free process algebras. I (Q1822946) (← links)
- Bisimulation of automata (Q1822987) (← links)
- Process rewrite systems. (Q1854328) (← links)
- Algorithmic analysis of programs with well quasi-ordered domains. (Q1854355) (← links)
- A fixpoint theory for non-monotonic parallelism (Q1884887) (← links)
- Branching time and orthogonal bisimulation equivalence (Q1884905) (← links)
- DP lower bounds for equivalence-checking and model-checking of one-counter automata (Q1887159) (← links)
- A theory of bisimulation for the \(\pi\)-calculus (Q1901699) (← links)
- Deriving structural labelled transitions for mobile ambients (Q1959484) (← links)
- Topology in process calculus. I: Limit behaviour of agents (Q1964363) (← links)
- Performance evaluation in stochastic process algebra dtsdPBC (Q2058309) (← links)
- Congruence from the operator's point of view. Syntactic requirements on modal characterizations (Q2182663) (← links)
- Off-the-shelf automated analysis of liveness properties for just paths (Q2182670) (← links)
- Discrete time stochastic and deterministic Petri box calculus dtsdPBC (Q2212703) (← links)
- Models and emerging trends of concurrent constraint programming (Q2348541) (← links)
- Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← links)
- A structural transformation from p-\(\pi\) to MSVL (Q2354315) (← links)
- Computable processes and bisimulation equivalence (Q2365394) (← links)
- Resources in process algebra (Q2373652) (← links)
- Control protocol synthesis for multi-agent systems with similar actions instantiated from agent and requirement templates (Q2409354) (← links)
- SOS rule formats for idempotent terms and idempotent unary operators (Q2436519) (← links)
- Pure bigraphs: structure and dynamics (Q2490119) (← links)
- Refinement of actions for real-time concurrent systems with causal ambiguity (Q2491208) (← links)
- \(\pi\)-calculus with noisy channels (Q2570971) (← links)
- Polarized process algebra with reactive composition (Q2571202) (← links)
- Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC (Q2633503) (← links)
- Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence) (Q2638769) (← links)
- Parallel processes with implicit computational capital (Q2870191) (← links)
- Process algebra having inherent choice: revised semantics for concurrent systems (Q2871829) (← links)
