Modeling concurrency with partial orders
From MaRDI portal
Publication:1091134
DOI10.1007/BF01379149zbMath0622.68034MaRDI QIDQ1091134
Publication date: 1986
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
temporal logicconcurrent processesformal languagespartial orderscomputation modelConcurrencypartial stringpartially ordered multisetspomsets
Related Items
Compositional process semantics of Petri Boxes, On the specification of elementary reactive behaviour, On relating some models for concurrency, Efficient rewriting in cograph trace monoids, An Analytic Propositional Proof System on Graphs, Languages of higher-dimensional automata, Temporal structures, Free shuffle algebras in language varieties extended abstract, Causality and true concurrency: A data-flow analysis of the Pi-Calculus, Nonfinite axiomatizability of shuffle inequalities, Read-write causality, Adding partial orders to linear temporal logic, Causal ambiguity and partial orders in event structures, Trade-offs in true concurrency: Pomsets and mazurkiewicz traces, On relating concurrency and nondeterminism, On continuous time agents, Branching Pomsets for Choreographies, Branching pomsets: design, expressiveness and applications to choreographies, Asynchronous cellular automata for pomsets without auto-concurrency, Bisimulation, games, and logic, Unnamed Item, On Weighted Petri Net Transducers, Truly concurrent constraint programming, Models and logics for true concurrency., Step traces, Unnamed Item, ENFORCING CONCURRENT TEMPORAL BEHAVIORS, The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems, Towards a language theory for infinite N-free pomsets., Event-based proof of the mutual exclusion property of Peterson's algorithm, On the mutual-exclusion problem -- a quest for minimal solutions, Detecting causal relationships in distributed computations: In search of the holy grail, A denotational semantics for SPARC TSO, Category-theoretic approach to software systems design, Undecidability of partial order logics, Refinement of events in the development of real-time distributed systems, Concurrent Kleene algebra with tests and branching automata, Nonfinite axiomatizability of the equational theory of shuffle, Towards refinable choreographies, Causal message sequence charts, Higher categories, strings, cubes and simplex equations, Automatizing parametric reasoning on distributed concurrent systems, Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol, Fairness, Resources, and Separation, A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable Resources, Schedulers and Finishers: On Generating the Behaviours of an Event Structure, Two equational theories of partial words, Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence), Interleaving set temporal logic, Step bisimulation is pomset equivalence on a parallel language without explicit internal choice, Concurrent Kleene Algebra, A compositional proof system on a category of labelled transition systems, Partial ordering models for concurrency can be defined operationally, The difference between splitting in \(n\) and \(n+1\), Temporal Structures, Architectural CCS, The equational theory of pomsets, Concurrency and atomicity, Modeling Quantitative Aspects of Concurrent Systems Using Weighted Petri Net Transducers, Posets with interfaces as a model for concurrency, Unnamed Item, Chu spaces as a semantic bridge between linear logic and mathematics., Presheaf models for CCS-like languages, Classifying invariant structures of step traces, Approximating Behaviors in Embedded System Design, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra, Reasoning about causality between distributed nonatomic events, Independence Abstractions and Models of Concurrency, On the homomorphism order of labeled posets, Branching versus linear logics yet again, Partial order behaviour and structure of Petri nets, Some behavioural aspects of net theory, A partial ordering semantics for CCS, Unnamed Item, MSO Logic for Unambiguous Shared-Memory Systems, Semantics of Deterministic Shared-Memory Systems, Four domains for concurrency, An algebra of concurrent non-deterministic processes, Connectedness and synchronization, Behavioural equivalence for infinite systems — Partially decidable!, Executions: A new partial-order semantics of Petri nets, Concurrent regular expressions and their relationship to Petri nets, Free shuffle algebras in language varieties, Denotational linear time semantics and sequential composition, On interprocess communication and the implementation of multi-writer atomic registers, Petri nets and bisimulation, On-the-fly analysis of distributed computations, An abstract framework for choreographic testing, Causality for mobile processes, Labeled posets are universal, Structure of concurrency, Bisimulation and action refinement, Universal axioms for bisimulations, Conflict vs causality in event structures, Relational structures for concurrent behaviours, Mitigating covert channels based on analysis of the potential for communication, Logical classification of distributed algorithms (Bakery algorithms as an example), CCS with Hennessy's merge has no finite-equational axiomatization, Concurrent Kleene algebra and its foundations, UNAMBIGUOUS SHARED-MEMORY SYSTEMS, Realisability of pomsets, A Nice labelling for tree-like event structures of degree 3, Synchronous Kleene algebra, Deciding global partial-order properties, Schedulers and finishers: on generating and filtering the behaviours of an event structure, Toward an algebraic theory of systems, Unnamed Item, Event Correlation with Boxed Pomsets, Executability of scenarios in Petri nets, Modular specification of process algebras, Modelling knowledge and action in distributed systems, Unifying Petri Net Semantics with Token Flows, Pomset Languages of Finite Step Transition Systems, Algebra and theory of order-deterministic pomsets, Failures semantics based on interval semiwords is a congruence for refinement, Series-parallel languages and the bounded-width property, Membership problems for regular and context-free trace languages, Non-interleaving semantics for mobile processes, Entropy conservation for comparison-based algorithms, Processes of timed Petri nets, Asynchronous cellular automata for pomsets, Molecular interaction., A Chart Semantics for the Pi-Calculus, A truly concurrent semantics for a process algebra using resource pomsets, A model of concurrency with fair merge and full recursion, Truly concurrent constraint programming, Axiomatizing the subsumption and subword preorders on finite and infinite partial words, Proving partial order properties
Cites Work
