The following pages link to Nets, Terms and Formulas (Q3997896):
Displaying 44 items.
- Processes with infinite liveness requirements (Q383788) (← links)
- Petri games: synthesis of distributed systems with causal memory (Q515654) (← links)
- Safe reasoning with logic LTS (Q549200) (← links)
- A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets (Q557805) (← links)
- A multiset semantics for the pi-calculus with replication (Q672867) (← links)
- On the implementation of concurrent calculi in net calculi: two case studies (Q673785) (← links)
- Conjunction on processes: Full abstraction via ready-tree semantics (Q875513) (← links)
- Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\) (Q893593) (← links)
- Ready simulation for concurrency: it's logical! (Q988555) (← links)
- Processes with local and global liveness requirements (Q1007234) (← links)
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS (Q1007235) (← links)
- A theory of structural stationarity in the \(\pi\)-calculus (Q1014276) (← links)
- A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems (Q1271643) (← links)
- Basic observables for processes (Q1286368) (← links)
- Model-checking discrete duration calculus (Q1346770) (← links)
- The difference between splitting in \(n\) and \(n+1\) (Q1370654) (← links)
- Petri nets, traces, and local model checking (Q1391100) (← links)
- The box algebra = Petri nets + process expressions (Q1854558) (← links)
- Petri nets and regular processes (Q1970202) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← 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)
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions (Q2340255) (← links)
- Verification of finite-state machines: a distributed approach (Q2413026) (← links)
- Nested-unit Petri nets (Q2423743) (← links)
- Process synchronisation as fusion (Q2563765) (← links)
- Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets (Q2941150) (← links)
- Encoding Asynchronous Interactions Using Open Petri Nets (Q3184668) (← links)
- Ernst-Rüdiger Olderog: A Life for Meaning (Q3449620) (← links)
- Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP (Q3449628) (← links)
- Language Representability of Finite P/T Nets (Q3460873) (← links)
- Ugo Montanari and Concurrency Theory (Q3507376) (← links)
- Safe Reasoning with Logic LTS (Q3599086) (← links)
- Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets (Q3613087) (← links)
- Solving recursive net equations (Q4645215) (← links)
- A case study in transformational design of concurrent systems (Q5044728) (← links)
- A refined view of the box algebra (Q5096357) (← links)
- A Study on Team Bisimulations for BPP Nets (Q5100755) (← links)
- Causal Semantics for BPP Nets with Silent Moves (Q5164874) (← links)
- Interfaces between languages for communicating systems (Q5204354) (← links)
- Divergence in testing and readiness semantics (Q5958758) (← links)
- Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets (Q6137873) (← links)
