The following pages link to Roberto Gorrieri (Q199202):
Displaying 50 items.
- On the implementation of concurrent calculi in net calculi: two case studies (Q673785) (← links)
- A theory of processes with durational actions (Q674005) (← links)
- Performance preorder and competitive equivalence (Q678252) (← links)
- Introduction to concurrency theory. Transition systems and CCS (Q897107) (← links)
- A\(^ 2\)CCS: Atomic actions for CCS (Q912608) (← links)
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS (Q1007235) (← links)
- Formal models and analysis of secure multicast in wired and wireless networks (Q1040779) (← links)
- A process algebraic view of Linda coordination primitives (Q1127512) (← links)
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time (Q1128976) (← links)
- A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems (Q1271643) (← links)
- Formal performance modelling and evaluation of an adaptive mechanism for packetised audio over the internet (Q1295865) (← links)
- (Q1575147) (redirect page) (← links)
- Comparing three semantics for Linda-like languages (Q1575148) (← links)
- The theory of interactive generalized semi-Markov processes (Q1603705) (← links)
- A comparison of three authentication properties. (Q1853750) (← links)
- On the expressiveness of Linda coordination primitives. (Q1854324) (← links)
- Vertical implementation (Q1854462) (← links)
- A simple framework for real-time cryptographic protocol analysis with compositional proof rules (Q1887729) (← links)
- Split and ST bisimulation semantics (Q1892889) (← links)
- A causal operational semantics of action refinement (Q1900316) (← links)
- Comparing syntactic and semantic action refinement (Q1917085) (← links)
- A study on team bisimulation and H-team bisimulation for BPP nets (Q2055961) (← links)
- Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves (Q2117014) (← links)
- Team equivalences for finite-state machines with silent moves (Q2216117) (← links)
- Team bisimilarity, and its associated modal logic, for BPP nets (Q2231652) (← links)
- Process algebras for Petri nets. The alphabetization of distributed systems (Q2406167) (← links)
- Verification of finite-state machines: a distributed approach (Q2413026) (← links)
- Quantitative information in the tuple space coordination model (Q2576948) (← links)
- (Q2736365) (← links)
- (Q2754157) (← links)
- (Q2754193) (← links)
- (Q2760253) (← links)
- (Q2767175) (← links)
- (Q2767180) (← links)
- (Q2771054) (← links)
- A Formalization of Credit and Responsibility Within the GNDC Schema (Q2804933) (← links)
- Techniques for Security Checking (Q2841279) (← links)
- Formal Models of Timing Attacks on Web Privacy (Q2841280) (← links)
- An Operational Petri Net Semantics for A2CCS (Q2895794) (← links)
- On Intransitive Non-interference in Some Models of Concurrency (Q3092180) (← links)
- On the Relationship between π-Calculus and Finite Place/Transition Petri Nets (Q3184693) (← links)
- TOWARDS HIERARCHICAL DESCRIPTION OF SYSTEMS: A PROOF SYSTEM FOR STRONG PREFIXING (Q3358247) (← links)
- (Q3413369) (← links)
- Language Representability of Finite P/T Nets (Q3460873) (← links)
- Ugo Montanari and Concurrency Theory (Q3507376) (← links)
- On the Expressive Power of Global and Local Priority in Process Calculi (Q3525641) (← links)
- Performance preorder: Ordering processes with respect to speed (Q3569033) (← links)
- Structural non-interference in elementary and trace nets (Q3655757) (← links)
- An expressiveness study of priority in process calculi (Q3655761) (← links)
- (Q3792236) (← links)
