scientific article; zbMATH DE number 3463159

Cited in

(38)

On coordinated selective substitutions: Towards a unified theory of grammars and machines
A generalized deadlock predicate
Petri nets, algebras, morphisms, and compositionality
On describing the behavior and implementation of distributed systems
Deadlock and fairness in parallel schemas: A set-theoretic characterization and decision problems
Observations on the complexity of regular expression problems
Flow languages equal recursively enumerable languages
Adequacy properties of path programs
Concurrent regular expressions and their relationship to Petri nets
Implementation approach to parallel systems
A specification of parallel problems
Synchronization trees
Dynamic constraints and object migration
Restrictions and representations of vector controlled concurrent system behaviours
Semi-commutations and Petri nets
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
Regularity conditions for iterated shuffle on commutative regular languages
The commutative closure of shuffle languages over group languages is regular
Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages
Characterization and complexity results on jumping finite automata
A compositional proof system on a category of labelled transition systems
On the design and specification of message oriented programs
Strong types for coordinating active objects
Sémantique du parallélisme et du choix du langage Electre
A case study in transformational design of concurrent systems
Kleene theorems for product systems
Interfaces between languages for communicating systems
Calculational design of a regular model checker by abstract interpretation
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
Compilation of the ELECTRE reactive language into finite transition systems
The n-ary initial literal and literal shuffle
On concurrent program algebra and demonic automata
PROCOL. A concurrent object-oriented language with protocols delegation and constraints
Port automata and the algebra of concurrent porcesses
A formal system for specification analysis of concurrent programs
Nets, sequential components and concurrency relations
On priority in COSY

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4048566)