A calculus of communicating systems
From MaRDI portal
Publication:1148667
zbMath0452.68027MaRDI QIDQ1148667
Publication date: 1980
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
concurrent systemsCSPobservational equivalenceCCScommunicating systemsconcurrent compositionsilent transitionsynchronized communications
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of operating systems (68N25)
Related Items
Model checking for action-based logics, Relation-based semantics for concurrency, A theory of processes with localities, Compact and efficiently verifiable models for concurrent systems, On sequential composition, action prefixes and process prefix, A UTP approach for rTiMo, Natural discrete-event process forecasting: A decision support system, Bisimulation is two-way simulation, A complete equational axiomatization for prefix iteration, Tracking CSP computations, Denotational semantics in the cpo and metric approach, Labelled domains and automata with concurrency, Property preserving abstractions for the verification of concurrent systems, Synchronization trees, Testing equivalences for processes, Formal specification of parallel SIMD execution, On reduction-based process semantics, On the operational semantics of nondeterminism and divergence, Branching bisimilarity is an equivalence indeed!, A \(\pi\)-calculus with explicit substitutions, On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus, Actors, actions, and initiative in normative system specification, Fuzzy approximations of fuzzy relational structures, An equational axiomatization for multi-exit iteration, Approximate analyzing of labeled transition systems, A complete axiomatization of finite-state ACSR processes, Confluence in concurrent constraint programming, Processes are in the eye of the beholder, Formal verification of a leader election protocol in process algebra, A semantic theory for value-passing processes based on the late approach, Towards categorical models for fairness: Fully abstract presheaf semantics of SCCS with finite delay, Encoding transition systems in sequent calculus, TTL: A modular language for hardware/software systems design., Undecidability of domino games and hhp-bisimilarity., New architectures for constructed complex systems, A computer scientist looks at game theory., Mathematical modal logic: A view of its evolution, Modeling and verification of reconfigurable printing system based on process algebra, Domain theory for concurrency, Conditions of contracts for separating responsibilities in heterogeneous systems, Dynamic algebras: Examples, constructions, applications, Symbolic model checking: \(10^{20}\) states and beyond, A compositional protocol verification using relativized bisimulation, Proof systems for infinite behaviours, Algebraic and functional specification of an interactive serializable database interface, Maximality preserving bisimulation, Fairness, distances and degrees, Strong fairness and ultra metrics, Experimenting with process equivalence, Causal automata, Labeled fuzzy approximations based on bisimulations, Applying model-checking to solve queries on semistructured data, Finitary logics for some CCS observational bisimulations, Structured operational semantics and bisimulation as a congruence, An algebraic semantics for structured transition systems and its application to logic programs, An algebraic characterisation of elementary net system (observable) state space, Deciding bisimilarity is P-complete, A type system for counting instances of software components, Unifying behavioral equivalences of timed transition systems, Synthesis of distinguishing test cases for timed finite state machines, Enriched categorical semantics for distributed calculi, Hybrid process algebra, A hierarchy of failures-based models: theory and application, A hierarchy of equivalences for asynchronous calculi, A brief history of process algebra, Observational congruences for dynamically reconfigurable tile systems, On the metric-based approximate minimization of Markov chains, An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation, Toward an algebraic theory of systems, Models and languages for description of parallel processes, Modelling knowledge and action in distributed systems, Submodule construction as equation solving in CCS, A complete axiomatisation for observational congruence of finite-state behaviours, Representation of computations in concurrent automata by dependence orders, Partial confluence of processes and systems of objects, Group axioms for iteration, A shorter proof to uniqueness of solutions of equations, Mobile ambients, Towards a unified view of bisimulation: A comparative study, A complexity analysis of bisimilarity for value-passing processes, Weak confluence and \(\tau\)-inertness, Language preorder as a precongruence, Topology, domain theory and theoretical computer science, Computation paths logic: An expressive, yet elementary, process logic, Universal coalgebra: A theory of systems, Relational transducers for electronic commerce, A complete modal proof system for HAL: the Herbrand agent language, Noninterference for concurrent programs and thread systems, A truly concurrent semantics for a process algebra using resource pomsets, Compositional SOS and beyond: A coalgebraic view of open systems, A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol, Resource traces: A domain for processes sharing exclusive resources., Bisimulation indexes and their applications, Hiding resources that can fail: An axiomatic perspective, Additive models of probabilistic processes, Operational and abstract semantics of the query language G-Log, Comparing logics for rewriting: Rewriting logic, action calculi and tile logic, The connection between an event structure semantics and an operational semantics for TCSP, Plain CHOCS. A second generation calculus for higher order processes, Elementary transition systems and refinement, Relating Coalgebraic Notions of Bisimulation, Factorization for Component-Interaction Automata, Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems, Composing models, Modeling for Verification, Partial-Order Reduction, Verification of Hybrid Systems, Process Algebra and Model Checking, Robin Milner's Work on Concurrency, Bisimulations Generated from Corecursive Equations, Network Conscious π-calculus: A Concurrent Semantics, Verification of Concurrent Programs on Weak Memory Models, Schedulers and Finishers: On Generating the Behaviours of an Event Structure, The Laws of Programming Unify Process Calculi, Trace Semantics for IPDL, Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence), Interleaving set temporal logic, Encoding Asynchronous Interactions Using Open Petri Nets, Weighted Bisimulation in Linear Algebraic Form, Concurrent Kleene Algebra, Concurrent bisimulations in Petri nets, A compositional proof system on a category of labelled transition systems, Real time process algebra, A Calculus for Local Reversibility, Static VS Dynamic Reversibility in CCS, Merge-and-Shrink Abstraction, Families of Symmetries as Efficient Models of Resource Binding, A mathematical model for system design and refinement, On the Expressiveness of the Interval Logic of Allen’s Relations Over Finite and Discrete Linear Orders, Fairness and communication-based semantics for session-typed languages, Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata, Hennessy-Milner properties via topological compactness, The Subject-Oriented Approach to Software Design and the Abstract State Machines Method, Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap, PROPOSITIONAL DYNAMIC LOGIC FOR REASONING ABOUT FIRST-CLASS AGENT INTERACTION PROTOCOLS, Compositional equivalences based on open pNets, Event structure semantics for multiparty sessions, Formalizing CCS and \(\pi\)-calculus in Guarded Cubical Agda, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra, Branching vs. Linear Time: Semantical Perspective, Decomposing monolithic processes in a process algebra with multi-actions, Models for CSP with availability information, Symbolic Semantics for Multiparty Interactions in the Link-Calculus, Unnamed Item, Unnamed Item, Model Based Importance Analysis for Minimal Cut Sets, Compositionality issues in discrete, continuous, and hybrid systems, A Rule Format for Associativity, A Ticking Clock: Performance Analysis of a Circadian Rhythm with Stochastic Process Algebra, Axiomatizing weak simulation semantics over BCCSP, A Single Complete Relational Rule for Coalgebraic Refinement, Deciding orthogonal bisimulation, Thread algebra for strategic interleaving, An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP, A semantic framework for open processes, The compositional construction of Markov processes II, Denotational semantics for thread algebra, Modular Markovian Logic, Unnamed Item, Notions of bisimulation and congruence formats for SOS with data, Pure bigraphs: structure and dynamics, On the expressiveness of higher dimensional automata, Model Driven Testing Based on Test History, Approximating and computing behavioural distances in probabilistic transition systems, Challenges in the Specification of Full Contracts, Verification of system level model transformations, Bisimulation for labelled Markov processes, PRISMA: A Mobile Calculus with Parametric Synchronization, Declarative Programming with Algebra, Chosen-Ciphertext Security from Subset Sum, Identity-Based Cryptosystems and Quadratic Residuosity, Decidable Extensions of Hennessy-Milner Logic, New Bisimulation Semantics for Distributed Systems, Simulations of Weighted Tree Automata, A Probabilistic Analysis of the Game of the Goose, A Look Around the Corner: The Pi-Calculus, Open maps in concrete categories and branching bisimulation for prefix orders, Structural Operational Semantics with First-Order Logic, Characterising Testing Preorders for Broadcasting Distributed Systems, Constructing the Views Framework, Dynamic Reactive Modules, Broadcast Psi-calculi with an Application to Wireless Protocols, On the Power of Attribute-Based Communication, Message Sequence Charts in the Development Process — Roles and Limitations, Generic Models of the Laws of Programming, Paths and Simulations, Hierarchical control of discrete-event systems, Synchronized shuffles, \(\pi\)-calculus with noisy channels, Polarized process algebra with reactive composition, A tutorial on coinductive stream calculus and signal flow graphs, Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic, Relating Hybrid Chi to Other Formalisms, Active Evaluation Contexts for Reaction Semantics, General Reversibility, Parallel Processes with Implicit Computational Capital, Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular, Keeping Secrets in Resource Aware Components, Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems, A Calculus for Team Automata, Weak bisimulations for fuzzy automata, Structural similarity: spectral methods for relaxed blockmodeling, A characterization of finitary bisimulation, Transition systems from event structures revisited, Developments in concurrent Kleene algebra, Concurrent abstract state machines, Formal modelling and verification of GALS systems using GRL and CADP, On the diversity of asynchronous communication, A basic algebra of stateless connectors, Duplication of constants in process algebra, Two-thirds simulation indexes and modal logic characterization, Fair testing, Behavioural equivalences of a probabilistic pi-calculus, Strong normalisation in the \(\pi\)-calculus, Generating the syntactic and semantics graphs for a Markovian process algebra, Testing probabilistic equivalence through reinforcement learning, Tackling continuous state-space explosion in a Markovian process algebra, A criterion for atomicity revisited, Deciding equivalence-based properties using constraint solving, A cylinder computation model for many-core parallel computing, Model of distributed computing system operation with time, Revisiting sequential composition in process calculi, Concurrent weighted logic, Symmetries, local names and dynamic (de)-allocation of names, An algebraic theory of interface automata, On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations, Generating symbolic traces in the insertion modeling system, Projection approaches to process mining using region-based techniques, Theory of interaction, Proving language inclusion and equivalence by coinduction, Bisimulations for fuzzy automata, Verification of distributed systems with the axiomatic system of MSVL, Nondeterministic automata: equivalence, bisimulations, and uniform relations, Value-passing CCS with noisy channels, A generic framework for \(n\)-protocol compatibility checking, Combining data type and recursive process specifications using projection algebras, Towards a theory of (self) applicative communicating processes: A short note, Coalgebras in functional programming and type theory, Active learning of nondeterministic finite state machines, Formal communication elimination and sequentialization equivalence proofs for distributed system models, A calculus of quality for robustness against unreliable communication, An algebraic theory for web service contracts, Confluence for process verification, Structural operational semantics for weak bisimulations, Compilation of the ELECTRE reactive language into finite transition systems, Late and early semantics coincide for testing, Deciding observational congruence of finite-state CCS expressions by rewriting, Translations between modal logics of reactive systems, Emergence of universal global behavior from reversible local transitions in asynchronous systems, Logical characterizations of simulation and bisimulation for fuzzy transition systems, Model-based testing of probabilistic systems, Structure of concurrency, Transition system specifications with negative premises, Modal logics for mobile processes, The expressive power of implicit specifications, Universal axioms for bisimulations, Computational interpretations of linear logic, Refinement of actions in event structures and causal trees, Communicating processes with value-passing and assignments, Computation of the greatest simulations and bisimulations between fuzzy automata, Mitigating covert channels based on analysis of the potential for communication, Network-conscious \(\pi\)-calculus -- a model of Pastry, Simulation refinement for concurrency verification, Building distributed controllers for systems with priorities, Category theory for operational semantics, Concurrent Kleene algebra and its foundations, On the computational complexity of bisimulation, redux, Measuring the confinement of probabilistic systems, Verification of reactive systems via instantiation of parameterised Boolean equation systems, Modal logics for communicating systems, Prespecification in data refinement, Refusal testing, An intensional characterization of the largest bisimulation, Observation equivalence as a testing equivalence, Fixed point equations with parameters in the projective model, Step failures semantics and a complete proof system, Reduction of fuzzy automata by means of fuzzy quasi-orders, Deadlock analysis of unbounded process networks, An operational semantics for object-oriented concepts based on the class hierarchy, Is hyper-extensionality preservable under deletions of graph elements?, Bisimulation and divergence, An operational semantics for paragon: A design notation for parallel architectures, Failures semantics based on interval semiwords is a congruence for refinement, Recursive process definitions with the state operator, Receptive process theory, On fluidization of discrete event models: Observation and control of continuous Petri nets, Branching bisimulation congruence for probabilistic systems, Raiders of the lost equivalence: probabilistic branching bisimilarity, A weakest precondition semantics for communicating processes, Algèbre de processus et synchronisation, Port automata and the algebra of concurrent porcesses, A fair calculus of communicating systems, Parametric channels via label expressions in CCS, A linear-history semantics for languages for distributed programming, A theory of bipolar synchronization scheme, A logical characterization of observation equivalence, Priorities in process algebras, On guarded recursion, A model of concurrency with fair merge and full recursion, Process algebra and constraint programming for modeling interactions in MAS, Mixed Sessions, On relating some models for concurrency, Verification and comparison of transition systems, A technique for specifying and refining TCSP processes by using guards and liveness conditions, Testability of a communicating system through an environment, A fully parallel calculus of synchronizing processes, Processes with multiple entries and exits, Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?, On the Approximation of the Resource Equivalences in Petri Nets with the Invisible Transitions, Aggregate approach for specification, validation, simulation and implementation of computer network protocols, Unnamed Item, Game theoretic analysis of call-by-value computation, On confluence in the π-calculus, An algebraic semantics for hierarchical P/T nets, A class of composable high level Petri nets, A decade of TAPSOFT, Generated models and the ω-rule: The nondeterministic case, A π-calculus with explicit substitutions: The late semantics, Bisimulation and propositional intuitionistic logic, First-order axioms for asynchrony, Tasks in modular proofs of concurrent algorithms, Parallelized sequential composition and hardware weak memory models, Composition of synchronous communicating systems, Explainability of probabilistic bisimilarity distances for labelled Markov chains, Just testing, A taxonomy for similarity metrics between Markov decision processes, Polynomial-time verification for bisimilarity control of partially observed nondeterministic discrete event systems with deterministic specifications, Rate lifting for stochastic process algebra -- exploiting structural properties, Retracing some paths in process algebra, Infinite results, Automated repair for timed systems, Nonwellfounded sets and programming language semantics, On relating concurrency and nondeterminism, Compositional Specification in Rewriting Logic, Jifeng He at Oxford and beyond: an appreciation, Intuitive modelling and formal analysis of collective behaviour in foraging ants, On Composing Communicating Systems, Lowerbounds for Bisimulation by Partition Refinement, HyperATL*: A Logic for Hyperproperties in Multi-Agent Systems, Behavioural equivalences for continuous-time Markov processes, String Diagrams for Layered Explanations, revTPL: The Reversible Temporal Process Language, Branching pomsets: design, expressiveness and applications to choreographies, The correctness of concurrencies in (reversible) concurrent calculi, Back to the format: a survey on SOS for probabilistic processes, Better automata through process algebra, Equivalence checking 40 years after: a review of bisimulation tools, On (left) partial shuffle, Bisimilarity enforcing supervisory control of nondeterministic discrete event systems with nondeterministic specifications, Unnamed Item, An interpreter for LOTOS, a specification language for distributed systems, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, On the control of incompletely described sequential machines, Unnamed Item, Calculational derivation of a counter with bounded response time and bounded power dissipation, Wait-free linearization with a mechanical proof, Synchronous, asynchronous, and causally ordered communication, Unnamed Item, Unnamed Item, Beyond series-parallel concurrent systems: the case of arch processes, From domains to automata with concurrency, Fairness and regularity for SCCS processes, Synchronized composition of graph grammar productions, The decomposition of ESM computations, Towards a Truly Concurrent Semantics for Reversible CCS, Elements of Stream Calculus, Rewrite Systems with Constraints, Unifying Semantics for Concurrent Programming, On the complexity of verifying concurrent transition systems, Visual Modeling of Distributed Object Systems by Graph Transformation, Objects and their lambda calculus, A process-calculus analysis of concurrent operations on B-trees, Inheritance of behavior, Gate splitting in LOTOS specifications using abstract interpretation, Real time process algebra with time-dependent conditions, Unnamed Item, A Finite Axiomatization of Nondeterministic Regular Expressions, Compositional priority specification in real-time distributed systems., Branching time controllers for discrete event systems, Recursive equations in higher-order process calculi, Free \(\mu\)-lattices, Proof-relevant π-calculus: a constructive account of concurrency and causality, Unnamed Item, Relating Structure and Power: Comonadic Semantics for Computational Resources, A categorical manifesto, On the corrective control of sequential machines, A Type System for Usage of Software Components, Process Algebra Modelling Styles for Biomolecular Processes, Formalizing Operational Semantic Specifications in Logic, Deciding bisimulation equivalences for a class of non-finite-state programs, The design and use of a prolog trace generator for CSP, Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages, On Communicating Finite-State Machines, Efficient Coalgebraic Partition Refinement, Concurrent Reversible Sessions, Message passing communication versus procedure call communication, A note on causal trees and their applications to CCS, On interprocess communication. I: Basic formalism, A model and temporal proof system for networks of processes, A theory for nondeterminism, parallelism, communication, and concurrency, Merging regular processes by means of fixed-point theory, Algebraic calculi of processes and net expressions, About fair asynchrony, An algebraic theory of fair asynchronous communicating processes, A context dependent equivalence between processes, Specification and top-down design of distributed systems, Bisimulations and abstraction homomorphisms, On the consistency of Koomen's fair abstraction rule, Petri nets, algebras, morphisms, and compositionality, Infinite streams and finite observations in the semantics of uniform concurrency, Communication in concurrent dynamic logic, An algebra of processes, Rewriting with a nondeterministic choice operator, On the analysis of cooperation and antagonism in networks of communicating processes, The complexity of reachability in distributed communicating processes, Cause-effect structures, An introduction to the regular theory of fairness, On the existence of delay-insensitive fair arbiters: Trace theory and its limitations, On observability of discrete-event systems, Trace, failure and testing equivalences for communicating processes, Global renaming operators in concrete process algebra, Applications of compactness in the Smyth powerdomain of streams, Semantics of production systems, A distributed operational semantics of CCS based on condition/event systems, Partial ordering models for concurrency can be defined operationally, A state-based approach to communicating processes, Metric semantics for concurrency, An incompleteness result in process algebra, The equational theory of pomsets, Stable families of behavioural equivalences, Sequential and concurrent behaviour in Petri net theory, Concurrent transition systems, Introduction to the theory of nested transactions, Hiding in stream semantics of uniform concurrency, Characterizing finite Kripke structures in propositional temporal logic, Type theory and concurrency, Concurrency and atomicity, Shuffle on trajectories: Syntactic constraints, A refinement calculus for specifications in Hennessy-Milner logic with recursion, Automated analysis of mutual exclusion algorithms using CCS, Process simulation and refinement, Proof systems for satisfiability in Hennessy-Milner logic with recursion, Some behavioural aspects of net theory, Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems), A partial ordering semantics for CCS, Algebraic specification of concurrent systems, A rewriting strategy to verify observational congruence, Interpreting one concurrent calculus in another, Step semantics for ``true concurrency with recursion, CCS expressions, finite state processes, and three problems of equivalence, Contractions in comparing concurrency semantics, A design method for embedded software systems, Reasoning about networks with many identical finite state processes, On finite alphabets and infinite bases, Generalizing the Paige-Tarjan algorithm by abstract interpretation, Formalization of test experiments, Domain theory in logical form, Bisimulation through probabilistic testing, Factorisation of finite state machines under strong and observational equivalences, Correctness of concurrent processes, Completing the temporal picture, The equivalence in the DCP model, Co-induction in relational semantics, Partial specifications and compositional verification, An algebra of concurrent non-deterministic processes, A proof system for communicating processes with value-passing, Compositionality and bisimulation: A negative result, An agent calculus with simple actions where the enabling and disabling are derived operators, \(\tau\)-bisimulations and full abstraction for refinement of actions, Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule, Concurrent regular expressions and their relationship to Petri nets, CPO semantics of timed interactive actor networks, Embedding mappings and splittings with applications, Algebra and logic for access control, A precongruence format for should testing preorder, Component simulation-based substitutivity managing QoS and composition issues, Fuzzy relation equations and reduction of fuzzy automata, On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP, Fully abstract models and refinements as tools to compare agents in timed coordination languages, A Rice-style theorem for parallel automata, Refinement and verification in component-based model-driven design, On the relationships between notions of simulation-based security, Robust safety of timed automata, Systems with priorities: conformance, testing, and composition, The compression structure of a process, Calculi for synchrony and asynchrony, Axiomatising finite delay operators, Models of programs and processes, A complete inference system for a class of regular behaviours, Non-deterministic data types: Models and implementations, On the suitability of trace semantics for modular proofs of communicating processes, A proof-theoretic characterization of observational equivalence, A language for linking modules into systems, Specification-oriented semantics for communicating processes, Determinacy \(\to\) (observation equivalence \(=\) trace equivalence), Hierarchical verification of asynchronous circuits using temporal logic, Performance evaluation of systems of cyclic sequential processes with mutual exclusion using Petri nets, On concurrent behaviors and focusing in linear logic, Sound reasoning in \textit{tock}-CSP, The origins of structural operational semantics, Axiomatizing GSOS with termination, Testing equivalence as a bisimulation equivalence, A theory of bisimulation for a fragment of concurrent ML with local names, Syntax and consistent equation semantics of hybrid Chi, Compositionality of Hennessy-Milner logic by structural operational semantics, Behavioural differential equations: a coinductive calculus of streams, automata, and power series, Branching time and orthogonal bisimulation equivalence, Bisimulation for Feller-Dynkin processes, Towards a classification of behavioural equivalences in continuous-time Markov processes, De Bakker-Zucker processes revisited, Behavioral complexity indicators for process algebra: The NKS approach, Axiomatizing recursion-free, regular monitors, Operational semantics of Framed Tempura, Hennessy-Milner and van Benthem for instantial neighbourhood logic, What is a free name in a process algebra?, Logic of transition systems, Modelling of DNA mismatch repair with a reversible process calculus, The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems, Comparative branching-time semantics for Markov chains, Trace nets and process automata, Correctness proof of a database replication protocol under the perspective of the I/O automaton model, The ins and outs of Petri net composition, On the complexity of determinizing monitors, Model theory of XPath on data trees. II: Binary bisimulation and definability, Monitorability for the Hennessy-Milner logic with recursion, Characteristic invariants in Hennessy-Milner logic, A complete axiomatization of weighted branching bisimulation, A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency, A framework for automated distributed implementation of component-based models, Keep it fair: equivalence and composition, Nested-unit Petri nets, A general overview of formal languages for individual-based modelling of ecosystems, A stable non-interleaving early operational semantics for the pi-calculus, In praise of algebra, Probabilistic may/must testing: retaining probabilities by restricted schedulers, Contextual equivalence for signal flow graphs, Exponential automatic amortized resource analysis, SOS rule formats for idempotent terms and idempotent unary operators, A system for compositional verification of asynchronous objects, The IITM model: a simple and expressive model for universal composability, Replacement freeness: a criterion for separating process calculi, Automated temporal equilibrium analysis: verification and synthesis of multi-player games, Deriving structural labelled transitions for mobile ambients, On logics with two variables, Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus, Bisimulation for probabilistic transition systems: A coalgebraic approach, Game-theoretic analysis of call-by-value computation, A parametric framework for reversible \(\pi\)-calculi, Introducing synchrony in fuzzy automata, Bisimulations for weighted automata over an additively idempotent semiring, Topology in process calculus. I: Limit behaviour of agents, Deciding bisimilarity and similarity for probabilistic processes., Limited approximate bisimulations and the corresponding rough approximations, From generic partition refinement to weighted tree automata minimization, The \(C_\pi\)-calculus: a model for confidential name passing, Complete proof systems for weighted modal logic, A network-conscious \(\pi\)-calculus and its coalgebraic semantics, A core model for choreographic programming, Investigating single-type structural elements of a component Petri net during component modeling and analysis of a complex system with parallelism, Infinite behaviour of Petri nets, A calculus for collective-adaptive systems and its behavioural theory, Static versus dynamic reversibility in CCS, A wide-spectrum language for verification of programs on weak memory models, A lightweight deadlock analysis for programs with threads and reentrant locks, A process calculus BigrTiMo of mobile systems and its formal semantics, Bisimulation and coinduction enhancements: a historical perspective, Fifty years of Hoare's logic, A logical and graphical framework for reaction systems, Matching logic explained, Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences, A calculus of concurrent graph-rewriting processes, Approximate bisimulation relations for fuzzy automata, Modular specification of process algebras, Locked discrete event systems: How to model and how to unlock, Problems of constructing intelligent systems. Intelligent modeling, Bisimulation of type 2 for BL-general fuzzy automata, Mixed sessions, Weak and strong fairness in CCS, Decentralized supervisory control of discrete-event systems, Fixed points in free process algebras. I, Bisimulation of automata, A game-semantic model of computation, Equational theories for automata, Processes against tests: on defining contextual equivalences, Denotational semantics of communicating processes based on a language for applicative multiprogramming, An interpretation of CCS into ludics, Concurrencies in reversible concurrent calculi, Structural operational semantics for continuous state stochastic transition systems, A partial order approach to branching time logic model checking., Alternation and bounded concurrency are reverse equivalent., Toward an infinitary logic of domains: Abramsky logic for transition systems, Strong fairness and full abstraction for communicating processes, On the complexity of verifying concurrent transition systems, Ordered SOS process languages for branching and eager bisimulations, A formal semantics for debugging synchronous message passing-based concurrent programs, Compositional verification of asynchronous concurrent systems using CADP, A structural transformation from p-\(\pi\) to MSVL, Distributed Adaptive Systems, Applied Choreographies, An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation, Concurrent Process Histories and Resource Transducers, A hierarchy of domains for real-time distributed computing, Termination, deadlock and divergence, Weighted synchronous automata, Three metric domains of processes for bisimulation, Axiomatising real-timed processes, EditorArrow: An arrow-based model for editor-based programming, Unnamed Item, Unnamed Item, Enhanced coalgebraic bisimulation, Psi-calculi in Isabelle, Quantifying conformance using the Skorokhod metric, Explicit Identifiers and Contexts in Reversible Concurrent Calculus, Reversibility and Predictions, An O(m log n) algorithm for branching bisimilarity on labelled transition systems, Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems, Decidability of Weak Bisimilarity for a Subset of BPA, Making the Unobservable, Unobservable, A Programming Language for Spatial Distribution of Net Systems, Bisimulation for Markov Decision Processes through Families of Functional Expressions, Decidable Fragments of a Higher Order Calculus with Locations, A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus, On asynchronous eventful session semantics, Deadlock Detection in Linear Recursive Programs, A fully abstract denotational model for observational precongruence, A fully abstract denotational semantics for the calculus of higher-order communicating systems, Pushdown automata, multiset automata, and Petri nets, Model Checking for Action Abstraction, Proved trees, Interfaces between languages for communicating systems, Testing preorders for probabilistic processes, Unnamed Item, Simulation Relations and Controllability Properties of Linear and Nonlinear Control Systems, Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application, Retracing CSP, Confluence Thanks to Extensional Determinism
