Software Descriptions with Flow Expressions

DOI10.1109/TSE.1978.231501zbMath0381.68035MaRDI QIDQ4162475

Alan C. Shaw

Publication date: 1978

Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)

Mathematics Subject Classification ID

Theory of operating systems (68N25) Theory of software (68N99)

Related Items

Infinite unfair shuffles and associativity ⋮ Literal shuffle ⋮ Unshuffling a square is NP-hard ⋮ Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages ⋮ The equational theory of pomsets ⋮ Shuffled languages -- representation and recognition ⋮ Regularity Conditions for Iterated Shuffle on Commutative Regular Languages ⋮ On describing the behavior and implementation of distributed systems ⋮ Ranking and Unranking k-Subsequence Universal Words ⋮ Longest Common Subsequence with Gap Constraints ⋮ Subsequences in bounded ranges: matching and analysis problems ⋮ On the expressive power of the shuffle operator matched with intersection by regular sets ⋮ Relations of flow languages to Petri net languages ⋮ Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems) ⋮ The power of synchronizing operations on strings ⋮ On universality of concurrent expressions with synchronization primitives ⋮ Unnamed Item ⋮ A P-complete language describable with iterated shuffle ⋮ A note on specifying and verifying concurrent processes ⋮ String shuffle: circuits and graphs ⋮ The Shuffle Product: New Research Directions ⋮ Lower Space Bounds for Accepting Shuffle Languages ⋮ On the enlargement of the class of regular languages by the shuffle closure ⋮ Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages ⋮ Synchronized shuffles ⋮ Shuffle languages are in P ⋮ 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 ⋮ Insertion languages ⋮ On the complexity of iterated shuffle ⋮ \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs ⋮ Extending regular expressions with iterated shuffle ⋮ Another generalization of Higman's well quasi order result on \(\Sigma ^*\) ⋮ 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