Pages that link to "Item:Q1187659"
From MaRDI portal
The following pages link to Finite representations of CCS and TCSP programs by automata and Petri nets (Q1187659):
Displaying 31 items.
- A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets (Q557805) (← links)
- Step failures semantics and a complete proof system (Q582133) (← 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)
- A note on the notation of recursion in process algebras (Q751295) (← links)
- Failures semantics based on interval semiwords is a congruence for refinement (Q757073) (← links)
- Introduction to concurrency theory. Transition systems and CCS (Q897107) (← links)
- Representing CCS programs by finite predicate-transition nets (Q1122360) (← links)
- A process algebraic view of Linda coordination primitives (Q1127512) (← links)
- Failure-equivalent transformation of transition systems to avoid internal actions (Q1209375) (← links)
- Operational and denotational semantics for the box algebra (Q1274445) (← links)
- Finite Petri nets as models for recursive causal behaviour (Q1318729) (← links)
- Proving finiteness of CCS processes by non-standard semantics (Q1323345) (← links)
- Open maps, behavioural equivalences, and congruences (Q1389441) (← links)
- The box algebra = Petri nets + process expressions (Q1854558) (← links)
- Generating BDDs for symbolic model checking in CCS (Q2365568) (← links)
- Nested-unit Petri nets (Q2423743) (← links)
- Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets (Q2941150) (← links)
- The Decidability of the Reachability Problem for CCS! (Q3090842) (← links)
- Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets (Q3613087) (← links)
- On the Expressive Power of Restriction and Priorities in CCS with Replication (Q3617733) (← links)
- (Q3795192) (← links)
- Behavioural equivalence for infinite systems — Partially decidable! (Q4633177) (← links)
- Solving recursive net equations (Q4645215) (← links)
- An algebraic semantics for hierarchical P/T nets (Q5096359) (← links)
- Persistent Stochastic Non-Interference (Q5158656) (← links)
- Open maps, behavioural equivalences, and congruences (Q5878914) (← links)
- Compositional process semantics of Petri Boxes (Q5890051) (← links)
- Infinite results (Q6104374) (← links)
- Regularity is decidable for normed BPA and normed BPP processes in polynomial time (Q6560192) (← links)
- Modal and temporal logics for processes (Q6560391) (← links)
