The following pages link to Damas Gruska (Q590927):
Displaying 28 items.
- Generalization and composition of modal squares of oppositions (Q346766) (← links)
- A process calculus with finitary comprehended terms (Q385508) (← links)
- A logical duality for underspecified probabilistic systems (Q532396) (← links)
- Algebraic separation logic (Q549676) (← links)
- On quasi-open bisimulation (Q557789) (← links)
- Transforming semantics by abstract interpretation (Q557807) (← links)
- To know or not to know: Epistemic approaches to security protocol verification (Q625717) (← links)
- Timed mobility in process algebra and Petri nets (Q638567) (← links)
- Model-checking in dense real-time (Q689092) (← links)
- Asynchronous mappings and asynchronous cellular automata (Q690237) (← links)
- Quantitative separation logic and programs with lists (Q707740) (← links)
- On the modal definability of simulability by finite transitive models (Q763328) (← links)
- A linear process-algebraic format with data for probabilistic automata (Q764285) (← links)
- Abelian networks. II: Halting on all inputs (Q907072) (← links)
- Using hybrid logic for coping with functions in subset spaces (Q965902) (← links)
- The modal logic of the countable random frame (Q1407589) (← links)
- Sufficient conditions for the marked graph realisability of labelled transition systems (Q1623288) (← links)
- Constructive logical characterizations of bisimilarity for reactive probabilistic systems (Q1731513) (← links)
- Combining temporal logic systems (Q1815427) (← links)
- Decidability results for metric and layered temporal logics (Q1815429) (← links)
- A spatial logic for concurrency. I (Q1887152) (← links)
- A new natural structural congruence in the pi-calculus with replication (Q1889854) (← links)
- Counting nondeterministic computations (Q2055958) (← links)
- Complete proof systems for weighted modal logic (Q2253184) (← links)
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes (Q2257984) (← links)
- Periodicity based decidable classes in a first order timed logic (Q2368906) (← links)
- Elementary canonical formulae: extending Sahlqvist's theorem (Q2498906) (← links)
- The undecidability of iterated modal relativization (Q2574887) (← links)