Process Algebra
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Probabilistic divide \& congruence: branching bisimilarity
- The box algebra = Petri nets + process expressions
- Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal
- Processes with local and global liveness requirements
- The expressive power of the shuffle product
- Network algebra for asynchronous dataflow∗
- Proving the validity of equations in GSOS languages using rule-matching bisimilarity
- Complexity of Weak Bisimilarity and Regularity for BPA and BPP
- On the operating unit size of load/store architectures
- A lean-congruence format for ep-bisimilarity
- Process algebra and model checking
- A theory of stochastic systems. II: Process algebra
- Operational and denotational semantics for the box algebra
- Symmetric electoral systems for ambient calculi
- The regular viewpoint on PA-processes
- An exact correspondence between a typed pi-calculus and polarised proof-nets
- Process algebra with language matching
- scientific article; zbMATH DE number 1404761 (Why is no real title available?)
- Strong types for coordinating active objects
- Branching bisimulation congruence for probabilistic systems
- Special issue: Process algebra
- A case study in transformational design of concurrent systems
- scientific article; zbMATH DE number 1487746 (Why is no real title available?)
- Qualitative reachability in stochastic BPA games
- scientific article; zbMATH DE number 1735902 (Why is no real title available?)
- Decidable first-order transition logics for PA-processes
- An algebraic semantics for hierarchical P/T nets
- Revisiting timing in process algebra.
- Modal and temporal logics for processes
- Maurer computers for pipelined instruction processing
- Hierarchical control of discrete-event systems
- The complexity of bisimilarity-checking for one-counter processes.
- Specifying termination in CSP
- A process algebraic view of input/output automata
- Denotational semantics for thread algebra
- Partial order semantics for use case and task models
- Lifting non-finite axiomatizability results to extensions of process algebras
- Shuffle on trajectories: Syntactic constraints
- Full abstraction and recursion
- On the expressiveness of interaction
- Contexts, refinement and determinism
- On the expressiveness of choice quantification
- scientific article; zbMATH DE number 4001464 (Why is no real title available?)
- Process algebra with action dependencies
- Modular specification of process algebras
- Action transducers and timed automata
- Structural operational semantics for weak bisimulations
- Divergence and unique solution of equations
- Category theory for operational semantics
- Process algebra with strategic interleaving
- A precongruence format for should testing preorder
- The algebra of communicating processes with empty process
- Comparing transition systems with independence and asynchronous transition systems
- Relating fair testing and accordance for service replaceability
- (Bi)simulations up-to characterise process semantics
- On the computational complexity of bisimulation, redux
- Approximate analyzing of labeled transition systems
- A specification structure for deadlock-freedom of synchronous processes
- Derivation tree analysis for accelerated fixed-point computation
- Fixing Zeno gaps
- The free process algebra generated by \(\delta \), \(\epsilon\) and \(\tau \)
- A randomized encoding of the \(\pi\)-calculus with mixed choice
- Embedding untimed into timed process algebra; the case for explicit termination
- SOS formats and meta-theory: 20 years after
- scientific article; zbMATH DE number 1412988 (Why is no real title available?)
- Finite axiom systems for testing preorder and De Simone process languages
- An algebra of hybrid systems
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
- Two finite specifications of a queue
- A fully abstract model for the \(\pi\)-calculus.
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
- scientific article; zbMATH DE number 7559462 (Why is no real title available?)
- Imperative process algebra and models of parallel computation
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
- Inheritance of behavior
- Verification of reactive systems via instantiation of parameterised Boolean equation systems
- An automata-theoretic approach to the reachability analysis of RPPS systems
- A conservative look at operational semantics with variable binding
- Simulating Turing machines on Maurer machines
- A complete equational axiomatization for MPA with string iteration
- Automating the refinement of specifications for distributed systems via syntactic transformations
- Linearization in parallel pCRL
- Precise interprocedural dependence analysis of parallel programs
- A formal approach to object-oriented software engineering
- Cones and foci: A mechanical framework for protocol verification
- Generating diagnostic information for behavioral preorders
- Preferential choice and coordination conditions
- A basic parallel process as a parallel pushdown automaton
- Process algebra with timing
- Discrete time generative-reactive probabilistic processes with different advancing speeds
- Shuffle on positive varieties of languages
- Final universes of processes
- The parallel composition of uniform processes with data
- Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis
- A logic for extensional protocols
- Rule formats for determinism and idempotence
- Bounded stacks, bags and queues
- GSOS and finite labelled transition systems
- Duplication of constants in process algebra
- Model checking a cache coherence protocol of a Java DSM implementation
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)
