Algebra of communicating processes with abstraction
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3852428 (Why is no real title available?)
- scientific article; zbMATH DE number 3878352 (Why is no real title available?)
- scientific article; zbMATH DE number 3978362 (Why is no real title available?)
- scientific article; zbMATH DE number 3986627 (Why is no real title available?)
- scientific article; zbMATH DE number 795666 (Why is no real title available?)
- A note on simplification orderings
- A term model for synchronous processes
- Algebra of communicating processes with abstraction
- Orderings for term-rewriting systems
- Process algebra for synchronous communication
- Processes and the denotational semantics of concurrency
- Synchronization trees
- Top-down design and the algebra of communicating processes
Cited in
(only showing first 100 items - show all)- Rule formats for distributivity
- Formal communication elimination and sequentialization equivalence proofs for distributed system models
- An abstract interpretation toolkit for \(\mu\)CRL
- scientific article; zbMATH DE number 1670866 (Why is no real title available?)
- A theory of bisimulation for the \(\pi\)-calculus
- Reactive Turing machines
- A process algebra of communicating shared resources with dense time and priorities
- \(\pi\)-calculus with noisy channels
- Revisiting sequential composition in process calculi
- Fixing Zeno gaps
- Additive models of probabilistic processes
- Cones and foci: A mechanical framework for protocol verification
- Just testing
- Verification of \(\mathrm{EB}^3\) specifications using CADP
- Specification-oriented semantics for communicating processes
- Network algebra for asynchronous dataflow∗
- LOTOS extended with probabilistic behaviours
- Preferential choice and coordination conditions
- An algebra of behavioural types
- Computable processes and bisimulation equivalence
- On cool congruence formats for weak bisimulations
- The algebra of communicating processes with empty process
- A calculus of mobile processes. I
- Universal axioms for bisimulations
- Combine and conquer: relating BIP and Reo
- The two-phase commitment protocol in an extended \(\pi\)-calculus
- An algebraic approach for modelling organisation, roles and contexts in MAS
- Process algebra and constraint programming for modeling interactions in MAS
- Behavioural equivalences of a probabilistic pi-calculus
- Bisimulation indexes and their applications
- Observing localities
- A general conservative extension theorem in process algebras with inequalities
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- Model checking usage policies
- Pure bigraphs: structure and dynamics
- Branching time and orthogonal bisimulation equivalence
- scientific article; zbMATH DE number 4117829 (Why is no real title available?)
- SOS rule formats for idempotent terms and idempotent unary operators
- Algorithmic analysis of programs with well quasi-ordered domains.
- Algebra of communicating processes with abstraction
- scientific article; zbMATH DE number 3990852 (Why is no real title available?)
- scientific article; zbMATH DE number 4011914 (Why is no real title available?)
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
- Resources in process algebra
- A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
- An algorithm for distributive unification
- From algebra to operational semantics
- Unification problems with one-sided distributivity
- Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)
- A theory of processes with localities
- Finite axiom systems for testing preorder and De Simone process languages
- Process rewrite systems.
- Modularity and implementation of mathematical operational semantics
- Modelling and verifying the AODV routing protocol
- Models and emerging trends of concurrent constraint programming
- Compositional verification of asynchronous concurrent systems using CADP
- A decision algorithm for distributive unification
- Diagnosis from scenarios
- On the operational semantics of nondeterminism and divergence
- A polynomial algorithm for deciding bisimilarity of normed context-free processes
- Non-regular iterators in process algebra
- Partially-commutative context-free processes: expressibility and tractability
- Bisimulation of automata
- Modeling Routing Protocols in Adhoc Networks
- TIC: a tImed calculus
- Infinite results
- A fixpoint theory for non-monotonic parallelism
- Behavioural abstraction in TCCS
- Two finite specifications of a queue
- scientific article; zbMATH DE number 4056992 (Why is no real title available?)
- Global renaming operators in concrete process algebra
- Pushdown automata, multiset automata, and Petri nets
- Using integer programming to verify general safety and liveness properties
- On the consistency of Koomen's fair abstraction rule
- On process equivalence = equation solving in CCS
- Value-passing CCS with noisy channels
- Issues in the design of a parallel object-oriented language
- A formal approach to object-oriented software engineering
- scientific article; zbMATH DE number 919840 (Why is no real title available?)
- Equivalence checking 40 years after: a review of bisimulation tools
- Polarized process algebra with reactive composition
- Performance evaluation in stochastic process algebra dtsdPBC
- A structural transformation from p-\(\pi\) to MSVL
- A Generic Process Algebra
- Back to the format: a survey on SOS for probabilistic processes
- On relating concurrency and nondeterminism
- Computing with actions and communications
- Discrete time process algebra with abstraction
- Fixed points in free process algebras. I
- A case in point: verification and testing of a EULYNX interface
- A family of resource-bound real-time process algebras
- Enriched categorical semantics for distributed calculi
- An equational axiomatization for multi-exit iteration
- Termination, deadlock and divergence
- Runners for interleaving algebraic effects
- The compression structure of a process
- Basic process algebra with deadlocking states
- Interleaving strategies
- Axiomatising real-timed processes
- Process algebra having inherent choice: revised semantics for concurrent systems
This page was built for publication: Algebra of communicating processes with abstraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1067408)
