Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ryszard Janicki
2010 – today
- 2012
[j26]Ryszard Janicki, Yun Zhai: On a pairwise comparison-based consistent non-numerical ranking. Logic Journal of the IGPL 20(4): 667-676 (2012)- [c57]Ryszard Janicki, Xiang Yin, Nadezhda Zubkova: Modeling Interval Order Structures with Partially Commutative Monoids. CONCUR 2012: 425-439
- [c56]Xiang Yin, Ryszard Janicki: Optimization of Quadtree Representation and Compression. RSCTC 2012: 198-205
- [e1]Tian-rui Li, Hung Son Nguyen, Guoyin Wang, Jerzy W. Grzymala-Busse, Ryszard Janicki, Aboul Ella Hassanien, Hong Yu (Eds.): Rough Sets and Knowledge Technology - 7th International Conference, RSKT 2012, Chengdu, China, August 17-20, 2012. Proceedings. Lecture Notes in Computer Science 7414, Springer 2012, ISBN 978-3-642-31899-3
- 2011
- [j25]
- [j24]Ryszard Janicki, Dai Tri Man Le: Modelling concurrency with comtraces and generalized comtraces. Inf. Comput. 209(11): 1355-1389 (2011)
- [j23]Ryszard Janicki: Approximations of Arbitrary Binary Relations by Partial Orders: Classical and Rough Set Models. T. Rough Sets 13: 17-38 (2011)
- [c55]
- 2010
- [c54]
- [c53]Waldemar W. Koczkodaj, Vova Babiy, Agnieszka D. Bogobowicz, Ryszard Janicki, Alan Wassyng: Selecting the best strategy in a software certification process. IMCSIT 2010: 53-58
- [c52]Yun Zhai, Ryszard Janicki: Preserving Consistency and Properties in Pairwise Comparisons Based Non-Numerical Ranking. Software Engineering Research and Practice 2010: 589-592
2000 – 2009
- 2009
- [j22]Ryszard Janicki: Pairwise Comparisons Based Non-Numerical Ranking. Fundam. Inform. 94(2): 197-217 (2009)
- [c51]Ryszard Janicki, Nadezhda Zubkova: On Closure Operator for Interval Order Structures. FCS 2009: 108-114
- [c50]Ryszard Janicki, Dai Tri Man Le, Nadezhda Zubkova: Closure Operators for Order Structures. FCT 2009: 217-229
- [c49]
- [c48]Ryszard Janicki, Ewa Romanowicz: Proving Properties of Programs with Theorem Provers - Experiments with Z3 and Simplify. Software Engineering Research and Practice 2009: 10-16
- [c47]Volodymyr Babiy, Ryszard Janicki, Tiffany Jingco, Tamar Kakiashvili, Waldemar W. Koczkodaj, Marc Woodbury-Smith: Benefits of Using Tabular Expressions in Planning Health Services. Software Engineering Research and Practice 2009: 99-102
- [c46]Imen Bourguiba, Ryszard Janicki: Tabular Expressions vs Software Cost Reduction. Software Engineering Research and Practice 2009: 403-407
- [i1]Ryszard Janicki, Dai Tri Man Le: Modelling Concurrency with Comtraces and Generalized Comtraces. CoRR abs/0907.1722 (2009)
- 2008
- [j21]
- [j20]Dai Tri Man Le, Ryszard Janicki: A Categorical Approach to Mereology and Its Application to Modelling Software Components. T. Rough Sets 8: 146-174 (2008)
- [c45]Ryszard Janicki, Dai Tri Man Le: Modelling Concurrency with Quotient Monoids. Petri Nets 2008: 251-269
- [c44]Ryszard Janicki: Some Remarks on Approximations of Arbitrary Binary Relations by Partial Orders. RSCTC 2008: 81-91
- [c43]
- 2007
- [j19]Ryszard Janicki, Dai Tri Man Le: Towards a Pragmatic Mereology. Fundam. Inform. 75(1-4): 295-314 (2007)
- [j18]Jacques Carette, Ryszard Janicki: Computing Properties of Numerical Imperative Programs by Symbolic Computation. Fundam. Inform. 80(1-3): 125-146 (2007)
- [c42]Ratvinder Singh Grewal, Ryszard Janicki, Tamar Kakiashvili, K. Kielan, Waldemar W. Koczkodaj, Kalpdrum Passi, Ryszard Tadeusiewicz: Attacking the Web Cancer with the Automatic Understanding Approach. AWIC 2007: 136-141
- [c41]
- 2006
- [j17]Ryszard Janicki: Special Issueon Application of Concurrency to System Design. Fundam. Inform. 70(1-2) (2006)
- [c40]Dai Tri Man Le, Ryszard Janicki: On a Parthood Specification Method for Component Software. RSCTC 2006: 537-546
- 2005
- [j16]Ryszard Janicki, Alan Wassyng: Tabular Expressions and Their Relational Semantics. Fundam. Inform. 67(4): 343-370 (2005)
- [c39]
- 2004
- [j15]
- [c38]Yu-Tong He, Ryszard Janicki: Verifying protocols by model checking: a case study of the wireless application protocol and the model checker SPIN. CASCON 2004: 174-188
- [c37]Ryszard Janicki: A Generalisation of a Relational Structures Model of Concurrency. ICTAC 2004: 84-98
- [c36]
- [c35]Ryszard Janicki, Yun Zhai: On Properties of 'Part of' Relations. Software Engineering Research and Practice 2004: 393-399
- [c34]Yuwen Yang, Ryszard Janicki: Modelling Concurrency with Tabular Expressions. Software Engineering Research and Practice 2004: 455-461
- 2003
- [c33]
- 2002
- [c32]Guangyuan Guo, Ryszard Janicki: Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations. AMAST 2002: 178-191
- [c31]Ryszard Janicki, Yuanyuan Zhang: A simplistic Mereological System for Relations. IC-AI 2002: 1206-1212
- [c30]Ryszard Janicki: On a Mereological System for Relational Software Specifications. MFCS 2002: 375-386
- [c29]Daniela Rosu, Ryszard Janicki: On Concurrency Control in Object-oriented Databases. PDPTA 2002: 956-962
- [c28]Ryszard Janicki: Towards a Mereological System for Direct Products and Relations. Rough Sets and Current Trends in Computing 2002: 113-122
- 2001
- [j14]Ryszard Janicki, Ridha Khédri: On a formal semantics of tabular expressions. Sci. Comput. Program. 39(2-3): 189-213 (2001)
- [j13]Ryszard Janicki, Emil Sekerinski: Foundations of the Trace Assertion Method of Module Interface Specification. IEEE Trans. Software Eng. 27(7): 577-598 (2001)
- 2000
- [c27]
- [c26]Ryszard Janicki, Yan Liu: On Trace Assertion Method of Module Interface Specification with Concurrency. Rough Sets and Current Trends in Computing 2000: 632-641
1990 – 1999
- 1999
- [j12]Ryszard Janicki, Maciej Koutny: On Causality Semantics of Nets with Priorities. Fundam. Inform. 38(3): 223-255 (1999)
- 1997
- [j11]Ryszard Janicki, Maciej Koutny: Fundamentals of Modelling Concurrency Using Discrete Relational Structures. Acta Inf. 34(5): 367-388 (1997)
- 1995
- [j10]
- [c25]
- 1994
- [j9]Ryszard Janicki, Maciej Koutny: Representations of Discrete Interval Orders and Semi-Orders. Elektronische Informationsverarbeitung und Kybernetik 30(3): 161-168 (1994)
- [c24]Ryszard Janicki, Maciej Koutny: Deriving Histories of Nets with Priority Relation. PARLE 1994: 623-634
- 1993
- [j8]
- [c23]Ryszard Janicki, Maciej Koutny: Order Structures and Generalisations of Szpilrajn's Theorem. FSTTCS 1993: 348-357
- 1991
- [c22]
- [c21]Ryszard Janicki, Maciej Koutny: Invariant Semantics of Nets with Inhibitor Arcs. CONCUR 1991: 317-331
- [c20]Ryszard Janicki, Maciej Koutny: Invariants and Paradigms of Concurrency Theory. PARLE (2) 1991: 59-74
- 1990
- [j7]Ryszard Janicki, Tomasz Müldner: Transformations of Sequential Specifications into Concurrent Specifications by Synchronization Guards. Theor. Comput. Sci. 77(1&2): 97-129 (1990)
- [c19]Ryszard Janicki, Tomasz Müldner: A Simple Realization of a Parallel Device Recognizing Regular Trace Languages. ACM Conference on Computer Science 1990: 147-153
- [c18]Ryszard Janicki, Maciej Koutny: Optimal simulations, nets and reachability graphs. Applications and Theory of Petri Nets 1990: 205-226
- [c17]Ryszard Janicki, Maciej Koutny: Using Optimal Simulations to Reduce Reachability Graphs. CAV 1990: 166-175
1980 – 1989
- 1989
- [c16]Ryszard Janicki, Tomasz Müldner: Complete Sequential Specification Allows for Concurrent Execution. ACM Conference on Computer Science 1989: 221-231
- [c15]Ryszard Janicki, Maciej Koutny: Towards A Theory Of Simulation For Verification Of Concurrent Systems. PARLE (2) 1989: 73-88
- 1988
- [c14]Ryszard Janicki: How to relieve a programmer from synchronization details. ACM Conference on Computer Science 1988: 438-446
- [c13]
- 1987
- [j6]Ryszard Janicki: A Formal Semantics for Concurrent Systems with a Priority Relation. Acta Inf. 24(1): 33-55 (1987)
- 1986
- [j5]Ryszard Janicki, Peter E. Lauer, Maciej Koutny, Raymond R. Devillers: Concurrent and Maximally Concurrent Evolution of Nonsequential Systems. Theor. Comput. Sci. 43: 213-238 (1986)
- [c12]Ryszard Janicki, Maciej Koutny: On equivalent execution semantics of concurrent systems. European Workshop on Applications and Theory of Petri Nets 1986: 89-103
- 1985
- [j4]Ryszard Janicki: An Equivalence Notion for Path Expressions Systems. Elektronische Informationsverarbeitung und Kybernetik 21(6): 283-295 (1985)
- [j3]Ryszard Janicki: Transforming Sequential Systems into Concurrent Systems. Theor. Comput. Sci. 36: 27-58 (1985)
- 1984
- [j2]Ryszard Janicki: Nets, Sequential Components and Concurrency Relations. Theor. Comput. Sci. 29: 87-121 (1984)
- [c11]Ryszard Janicki, Peter E. Lauer, Raymond R. Devillers: Maximally Concurrent Evolution of Non-sequential Systems. Seminar on Concurrency 1984: 268-280
- [c10]
- 1981
- [c9]
- [c8]Ryszard Janicki: A Construction of Concurrent Systems by Means of Sequential Solutions and Concurrency Relations. ICFPC 1981: 327-334
- 1980
- [j1]Ryszard Janicki: Some remarks on deterministic Mazurkiewicz algorithms and languages associated with them. Fundam. Inform. 3(1): 65-76 (1980)
- [c7]
- [c6]
1970 – 1979
- 1979
- [c5]
- [c4]Ryszard Janicki: A Characterization of Concurrency-Like Relations. Semantics of Concurrent Computation 1979: 109-122
- 1978
- [c3]
- 1977
- [c2]
- 1976
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:27 CET by the dblp team