Process Algebra
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- An algebra of hybrid systems
- Probabilistic mobile ambients
- Processes with local and global liveness requirements
- Generating priority rewrite systems for OSOS process languages
- (Bi)simulations up-to characterise process semantics
- A note on an expressiveness hierarchy for multi-exit iteration
- Shuffle on trajectories: Syntactic constraints
- An algebra of concurrent non-deterministic processes
- Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule
- Petri net semantics of priority systems
- A conservative look at operational semantics with variable binding
- Operational and denotational semantics for the box algebra
- A complete equational axiomatization for MPA with string iteration
- A decision algorithm for distributive unification
- A behavioural theory of first-order CML
- Real space process algebra
- Process algebra with guards: Combining hoare logic with process algebra
- GSOS and finite labelled transition systems
- On sequential composition, action prefixes and process prefix
- Bisimulation is two-way simulation
- Focus points and convergent process operators: A proof strategy for protocol verification
- Branching bisimilarity is an equivalence indeed!
- Actors, actions, and initiative in normative system specification
- Formalizing process algebraic verifications in the calculus of constructions
- Full abstraction and recursion
- An equational axiomatization for multi-exit iteration
- The equational logic of fixed points
- The algebra of communicating processes with empty process
- A general conservative extension theorem in process algebras with inequalities
- Process algebra with propositional signals
- Process algebra with language matching
- Formal verification of a leader election protocol in process algebra
- Two finite specifications of a queue
- Revisiting timing in process algebra.
- Analysis of a distributed system for lifting trucks.
- A fully abstract model for the \(\pi\)-calculus.
- The complexity of bisimilarity-checking for one-counter processes.
- Finite axiom systems for testing preorder and De Simone process languages
- Effective decomposability of sequential behaviours
- Swinging types=functions+relations+transition systems
- Language preorder as a precongruence
- A hidden agenda
- Bisimulation indexes and their applications
- Process algebra and conditional composition
- Impossible futures and determinism
- Equivalence of recursive specifications in process algebra
- Special issue: Process algebra
- A formal approach to object-oriented software engineering
- Process algebra with action dependencies
- Approximate analyzing of labeled transition systems
- Hybrid process algebra
- CCS with Hennessy's merge has no finite-equational axiomatization
- A brief history of process algebra
- Process algebra for hybrid systems
- On the usability of process algebra: An architectural view
- An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
- Modular specification of process algebras
- Algebra and theory of order-deterministic pomsets
- Action transducers and timed automata
- Process algebra with timing
- Process algebras for systems diagnosis.
- Discrete time generative-reactive probabilistic processes with different advancing speeds
- Bisimilarity of open terms.
- Decoding choice encodings
- Vertical implementation
- Simulation preorder over simple process algebras
- The box algebra = Petri nets + process expressions
- Ordered SOS process languages for branching and eager bisimulations
- On the expressiveness of choice quantification
- Axiomatizing GSOS with termination
- Rule formats for compositional non-interference properties
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- Branching time and orthogonal bisimulation equivalence
- Precise interprocedural dependence analysis of parallel programs
- Shuffle on positive varieties of languages
- Discrete time process algebra
- Categorical shape theory as a formal language for pattern recognition?
- Timing and causality in process algebra
- A specification structure for deadlock-freedom of synchronous processes
- Models of nondeterministic regular expressions
- Rooted branching bisimulation as a congruence
- Process algebra with strategic interleaving
- Probabilistic divide \& congruence: branching bisimilarity
- Ensuring liveness properties of distributed systems: open problems
- Matching logic explained
- Near-ring congruences on seminearrings
- Refinement-oriented probability for CSP
- Computable processes and bisimulation equivalence
- Continuity controlled hybrid automata
- Linearization of hybrid processes
- Syntax and consistent equation semantics of hybrid Chi
- Non-bisimulation-based Markovian behavioral equivalences
- Operational semantics for Petri net components
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
- Denotational semantics for thread algebra
- Symmetric electoral systems for ambient calculi
- Simulating Turing machines on Maurer machines
- On the expressiveness of higher dimensional automata
- Branching bisimulation for probabilistic systems: characteristics and decidability
- Splitting bisimulations and retrospective conditions
This page was built for publication: Process Algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3999164)
