The following pages link to (Q4054644):
Displaying 50 items.
- There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations (Q286953) (← links)
- Fixed points of mappings with a contractive iterate at a point in partial metric spaces (Q402515) (← links)
- A generalized contraction principle with control functions on partial metric spaces (Q418388) (← links)
- Non-standard semantics of hybrid systems modelers (Q439952) (← links)
- Modeling of complex systems. II: A minimalist and unified semantics for heterogeneous integrated systems (Q440664) (← links)
- Hyperspaces of a weightable quasi-metric space: application to models in the theory of computation (Q614291) (← links)
- An extensional treatment of lazy data flow deadlock (Q671995) (← links)
- Conversation protocols: a formalism for specification and verification of reactive electronic services (Q703491) (← links)
- A fixed point approach to parallel discrete event simulation (Q758225) (← links)
- A linear-history semantics for languages for distributed programming (Q796298) (← links)
- A proof of the determinacy property of the data flow schema (Q796973) (← links)
- A model of concurrency with fair merge and full recursion (Q808690) (← links)
- Automated analysis of fault-tolerance in distributed systems (Q816197) (← links)
- Partial metric monoids and semivaluation spaces (Q818425) (← links)
- Productivity of stream definitions (Q846366) (← links)
- Merged processes: a new condensed representation of Petri net behaviour (Q854679) (← links)
- Scalable and structured scheduling (Q862862) (← links)
- The SL synchronous language, revisited (Q864504) (← links)
- The Banach fixed point theorem in fuzzy quasi-metric spaces with application to the domain of words (Q886315) (← links)
- A functional programming approach to the specification and verification of concurrent systems (Q909439) (← links)
- Equational reasoning about nondeterministic processes (Q911801) (← links)
- Recursion equation sets computing logic programs (Q920624) (← links)
- CPO semantics of timed interactive actor networks (Q959824) (← links)
- Parallelizing XML data-streaming workflows via MapReduce (Q980993) (← links)
- Asynchronous sequential processes (Q1013090) (← links)
- Computing the behaviour of asynchronous processes (Q1054152) (← links)
- On the suitability of trace semantics for modular proofs of communicating processes (Q1060004) (← links)
- Dataflow computing and Eager and Lazy evaluations (Q1077928) (← links)
- A model and temporal proof system for networks of processes (Q1079948) (← links)
- A theory for nondeterminism, parallelism, communication, and concurrency (Q1081296) (← links)
- Modeling concurrency with partial orders (Q1091134) (← links)
- An algebra of processes (Q1096381) (← links)
- Concurrent transition systems (Q1119395) (← links)
- Linear dynamic Kahn networks are deterministic (Q1128478) (← links)
- Temporal analysis of data flow control systems (Q1129680) (← links)
- Semantics of nondeterminism, concurrency, and communication (Q1139946) (← links)
- The temporal semantics of concurrent programs (Q1143164) (← links)
- An extensional treatment of dataflow deadlock (Q1143166) (← links)
- Deadlock absence proofs for networks of communicating processes (Q1151025) (← links)
- Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable (Q1162807) (← links)
- Connectedness and synchronization (Q1179707) (← links)
- An extensional fixed-point semantics for nondeterministic data flow (Q1183593) (← links)
- Clocks in dataflow languages (Q1185019) (← links)
- Specification and design of shared resource arbitration (Q1186094) (← links)
- A denotational theory of synchronous reactive systems (Q1193599) (← links)
- Axiomatic treatment of processes with shared variables revisited (Q1194205) (← links)
- PASCAL in LCF: Semantics and examples of proof (Q1242670) (← links)
- A fully abstract semantics for concurrent constraint programming (Q1275748) (← links)
- Defining concurrent processes constructively (Q1314421) (← links)
- A denotational semantics and dataflow construction for logic programs (Q1318723) (← links)
