The following pages link to (Q4048566):
Displaying 36 items.
- Compilation of the ELECTRE reactive language into finite transition systems (Q673127) (← links)
- PROCOL. A concurrent object-oriented language with protocols delegation and constraints (Q758195) (← links)
- Port automata and the algebra of concurrent porcesses (Q791319) (← links)
- A formal system for specification analysis of concurrent programs (Q792086) (← links)
- Nets, sequential components and concurrency relations (Q797994) (← links)
- On priority in COSY (Q914367) (← links)
- On coordinated selective substitutions: Towards a unified theory of grammars and machines (Q1081311) (← links)
- A generalized deadlock predicate (Q1085972) (← links)
- Petri nets, algebras, morphisms, and compositionality (Q1091145) (← links)
- On describing the behavior and implementation of distributed systems (Q1143167) (← links)
- Deadlock and fairness in parallel schemas: A set-theoretic characterization and decision problems (Q1145493) (← links)
- Observations on the complexity of regular expression problems (Q1149249) (← links)
- Flow languages equal recursively enumerable languages (Q1151054) (← links)
- Adequacy properties of path programs (Q1161276) (← links)
- Concurrent regular expressions and their relationship to Petri nets (Q1184987) (← links)
- Implementation approach to parallel systems (Q1249432) (← links)
- A specification of parallel problems (Q1257334) (← links)
- Synchronization trees (Q1348524) (← links)
- Dynamic constraints and object migration (Q1390938) (← links)
- Restrictions and representations of vector controlled concurrent system behaviours (Q1391736) (← links)
- Semi-commutations and Petri nets (Q1822948) (← links)
- Commutative regular languages with product-form minimal automata (Q2096583) (← links)
- State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages (Q2096584) (← links)
- Regularity conditions for iterated shuffle on commutative regular languages (Q2117658) (← links)
- The commutative closure of shuffle languages over group languages is regular (Q2117662) (← links)
- Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages (Q2163995) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- A compositional proof system on a category of labelled transition systems (Q2640340) (← links)
- On the design and specification of message oriented programs (Q3891748) (← links)
- Strong types for coordinating active objects (Q4790922) (← links)
- Sémantique du parallélisme et du choix du langage Electre (Q4858847) (← links)
- A case study in transformational design of concurrent systems (Q5044728) (← links)
- Kleene Theorems for Product Systems (Q5200095) (← links)
- Interfaces between languages for communicating systems (Q5204354) (← links)
- Calculational design of a regular model checker by abstract interpretation (Q5896884) (← links)
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages (Q6070751) (← links)
