scientific article
From MaRDI portal
Publication:4048566
zbMath0295.68028MaRDI QIDQ4048566
A. N. Habermann, R. H. Campbell
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On coordinated selective substitutions: Towards a unified theory of grammars and machines ⋮ Strong types for coordinating active objects ⋮ A generalized deadlock predicate ⋮ A case study in transformational design of concurrent systems ⋮ Petri nets, algebras, morphisms, and compositionality ⋮ Synchronization trees ⋮ A compositional proof system on a category of labelled transition systems ⋮ Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages ⋮ Dynamic constraints and object migration ⋮ Restrictions and representations of vector controlled concurrent system behaviours ⋮ Regularity Conditions for Iterated Shuffle on Commutative Regular Languages ⋮ On describing the behavior and implementation of distributed systems ⋮ Deadlock and fairness in parallel schemas: A set-theoretic characterization and decision problems ⋮ Sémantique du parallélisme et du choix du langage Electre ⋮ Observations on the complexity of regular expression problems ⋮ Flow languages equal recursively enumerable languages ⋮ On priority in COSY ⋮ Adequacy properties of path programs ⋮ Concurrent regular expressions and their relationship to Petri nets ⋮ Calculational design of a regular model checker by abstract interpretation ⋮ Compilation of the ELECTRE reactive language into finite transition systems ⋮ Kleene Theorems for Product Systems ⋮ Interfaces between languages for communicating systems ⋮ Implementation approach to parallel systems ⋮ A specification of parallel problems ⋮ On the design and specification of message oriented programs ⋮ PROCOL. A concurrent object-oriented language with protocols delegation and constraints ⋮ Semi-commutations and Petri nets ⋮ Port automata and the algebra of concurrent porcesses ⋮ A formal system for specification analysis of concurrent programs ⋮ Commutative regular languages with product-form minimal automata ⋮ State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages ⋮ Nets, sequential components and concurrency relations ⋮ Regularity conditions for iterated shuffle on commutative regular languages ⋮ The commutative closure of shuffle languages over group languages is regular ⋮ Characterization and complexity results on jumping finite automata
