Higher-level synchronising devices in Meije-SCCS

DOI10.1016/0304-3975(85)90093-3zbMath0598.68027OpenAlexW2070157304MaRDI QIDQ1079949

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90093-3

zbMATH Keywords

parallelism synchronisation processes SCCS calculus equivalence proofs for open expressions semantical conditional rules transformations of transition systems

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

Modelling and analysing neural networks using a hybrid process algebra, Proving the validity of equations in GSOS languages using rule-matching bisimilarity, GSOS and finite labelled transition systems, Rule formats for compositional non-interference properties, Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation, When is partial trace equivalence adequate?, Computable processes and bisimulation equivalence, Compositionality of Hennessy-Milner logic by structural operational semantics, A format for semantic equivalence comparison, Automatizing parametric reasoning on distributed concurrent systems, Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?, A \(\pi\)-calculus with explicit substitutions, On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus, A domain equation for bisimulation, Fair testing, A unified rule format for bounded nondeterminism in SOS with terms as labels, SOS formats and meta-theory: 20 years after, Concurrency and atomicity, SOS specifications for uniformly continuous operators, Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity, SMT-based generation of symbolic automata, A Calculus of Countable Broadcasting Systems, A π-calculus with explicit substitutions: The late semantics, Compositional semantics and behavioural equivalences for reaction systems with restriction, Expressiveness of concurrent intensionality, Compositional equivalences based on open pNets, Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity, Back to the format: a survey on SOS for probabilistic processes, Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction, Comparing the expressiveness of the \(\pi \)-calculus and CCS, Unnamed Item, A calculus and logic of bunched resources and processes, Replacement freeness: a criterion for separating process calculi, Unnamed Item, Compositional semantics and behavioral equivalences for P systems, Unnamed Item, A Rule Format for Associativity, Partial specifications and compositional verification, A semantic framework for open processes, A process algebraic view of input/output automata, The chemical abstract machine, Experimenting with process equivalence, Transition system specifications with negative premises, The expressive power of implicit specifications, Structured operational semantics and bisimulation as a congruence, Broadcast Calculus Interpreted in CCS upto Bisimulation, Turing Machines, Transition Systems, and Interaction, An algebra for process creation, Rule formats for distributivity, Variable binding operators in transition system specifications, CCS with Hennessy's merge has no finite-equational axiomatization, Probabilistic divide \& congruence: branching bisimilarity, Non-deterministic structures of computation, Notions of bisimulation and congruence formats for SOS with data, On cool congruence formats for weak bisimulations, Turing machines, transition systems, and interaction, Ensuring liveness properties of distributed systems: open problems, Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes, A precongruence format for should testing preorder, A coalgebraic presentation of structured transition systems, Synchronous Kleene algebra, Unnamed Item, Compositional semantics of spiking neural P systems, Observational congruences for dynamically reconfigurable tile systems, Step failures semantics and a complete proof system, From rewrite rules to bisimulation congruences, Explicit substitutions for \(\pi\)-congruences, New Bisimulation Semantics for Distributed Systems, A Timed Process Algebra for Wireless Networks with an Application in Routing, AN OVERVIEW ON OPERATIONAL SEMANTICS IN MEMBRANE COMPUTING, Semantics and expressiveness of ordered SOS, Bialgebraic methods and modal logic in structural operational semantics, Bialgebraic foundations for the operational semantics of string diagrams, Action transducers and timed automata, A conservative look at operational semantics with variable binding, A Theory for the Composition of Concurrent Processes, Algebra and logic for resource-based systems modelling, Finite axiom systems for testing preorder and De Simone process languages, Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus, LANGUAGES FOR REACTIVE SPECIFICATIONS: SYNCHRONY VS ASYNCHRONY, Non Expansive ε-Bisimulations, On constructibility and unconstructibility of LTS operators from other LTS operators, A comparison of Statecharts step semantics, Tile formats for located and mobile systems., Bisimilarity of open terms., Ordered SOS process languages for branching and eager bisimulations, Expressiveness of Process Algebras, Dynamic connectors for concurrency, Compositional SOS and beyond: A coalgebraic view of open systems, Algebraic specification of agent computation

Cites Work