Advanced Thread Synchronization in Java Using Interaction Expressions
NODe '02 Revised Papers from the International Conference NetObjectDays on Objects, Components, Architectures, Services, and Applications for a Networked World
Infinite unfair shuffles and associativity
Theoretical Computer Science
Structured Specification of Communicating Systems
IEEE Transactions on Computers
A Theory for Protocol Validation
IEEE Transactions on Computers - Lecture notes in computer science Vol. 174
Associativity of Infinite Synchronized Shuffles and Team Automata
Fundamenta Informaticae
An approach to software system behavior description
Computer Languages
High-level debugging of distributed systems: The behavioral abstraction approach
Journal of Systems and Software
Behavior specification in a software design system
Journal of Systems and Software
Associativity of Infinite Synchronized Shuffles and Team Automata
Fundamenta Informaticae
Synchronized Shuffle on Backbones
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
UNDECIDABILITY OF LANGUAGE EQUIVALENCE FOR GENERALIZED REGULAR EXPRESSIONS
Fundamenta Informaticae
Unshuffling a square is NP-hard
Journal of Computer and System Sciences
| Hi-index | 0.01 |
Flow expressions describe sequential and concurrent flows of entities, such as control, messages, commands, jobs, and resources, through system software components, such as programs, procedures, modules, and processes. They consist of regular expressions extended with cyclic and interleaving operators and a synchronization facility. The language of flow expressions is defined and some of its formal properties are presented. Applications are exhibited in the modeling of concurrent programs, the description of operating system architectures, the specification and solution of synchronization problems, the flow and description of command languages, and in systems analysis and verification.