The following pages link to (Q2760247):
Displaying 19 items.
- A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets (Q557805) (← links)
- Bisimulation on speed: Worst-case efficiency (Q598200) (← links)
- Process-algebraic approaches for multi-agent systems: an overview (Q814895) (← links)
- Generating priority rewrite systems for OSOS process languages (Q1012121) (← links)
- Bialgebraic methods and modal logic in structural operational semantics (Q1012126) (← links)
- Revisiting timing in process algebra. (Q1394990) (← links)
- An alternative formulation of operational conservativity with binding terms. (Q1400151) (← links)
- Process algebra for hybrid systems (Q1781998) (← links)
- Expired data collection in shared dataspaces. (Q1874282) (← links)
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation (Q1878718) (← links)
- Decidability and complexity of action-based temporal planning over dense time (Q2124463) (← links)
- Continuity controlled hybrid automata (Q2368692) (← links)
- Decidability of performance equivalence for basic parallel processes (Q2503324) (← links)
- Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format (Q3605462) (← links)
- Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination (Q4917024) (← links)
- Bisimulation on speed: Lower time bounds (Q5313721) (← links)
- Variable binding operators in transition system specifications (Q5931555) (← links)
- Real time process algebra with time-dependent conditions (Q5946026) (← links)
- Discussion on: ``Formal specification method for systems automation'' (Q5971345) (← links)
